Sensing as a Complexity Measure

Shaull Almagor (1) , Denis Kuperberg (2) , Orna Kupferman (3)

1 Oxford Brookes University
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 HUJ - The Hebrew University of Jerusalem

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.

Domaines: Informatique [cs]

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⟩