Abstract
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 | English |
|---|---|
| Pages (from-to) | 831-873 |
| Number of pages | 43 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 30 |
| Issue number | 6-7 |
| DOIs | |
| State | Published - 1 Sep 2019 |
Bibliographical note
Publisher Copyright:© 2019 World Scientific Publishing Company.
Keywords
- Automata
- complexity
- minimization
- regular languages
- sensing
- ω-regular languages