The size of deterministic automata required for recognizing regular and ω-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and ω-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.
|Original language||American English|
|Number of pages||43|
|Journal||International Journal of Foundations of Computer Science|
|State||Published - 1 Sep 2019|
Bibliographical noteFunding Information:
The research leading to these results has received funding from the European Research Council under the European Union's 7th Framework Programme (FP7/2007-2013, ERC Grant No. 278410).
The paper gives an overview of the technical results in the papers  and . The research leading to these results has received funding from the European Research Council under the European Union’s 7th Framework Programme (FP7/2007-2013, ERC Grant No. 278410).
© 2019 World Scientific Publishing Company.
- regular languages
- ω-regular languages