Sensing as a Complexity Measure - Descriptional Complexity of Formal Systems (DCFS 2017) Access content directly
Conference Papers Year : 2017

Sensing as a Complexity Measure


The size of deterministic automata required for recognizing regular and $\omega $-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 $\omega $-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.
Fichier principal
Vignette du fichier
440206_1_En_1_Chapter.pdf (336.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657019 , version 1 (06-12-2017)





Shaull Almagor, Denis Kuperberg, Orna Kupferman. Sensing as a Complexity Measure. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.3-15, ⟨10.1007/978-3-319-60252-3_1⟩. ⟨hal-01657019⟩
142 View
143 Download



Gmail Facebook X LinkedIn More