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 |
|---|---|
| Title of host publication | Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings |
| Editors | Giovanni Pighizzini, Cezar Campeanu |
| Publisher | Springer Verlag |
| Pages | 3-15 |
| Number of pages | 13 |
| ISBN (Print) | 9783319602516 |
| DOIs | |
| State | Published - 2017 |
| Event | 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy Duration: 3 Jul 2017 → 5 Jul 2017 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 10316 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 |
|---|---|
| Country/Territory | Italy |
| City | Milano |
| Period | 3/07/17 → 5/07/17 |
Bibliographical note
Publisher Copyright:© IFIP International Federation for Information Processing 2017.