Sensing as a Complexity Measure

Shaull Almagor*, Denis Kuperberg, Orna Kupferman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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 languageAmerican English
Pages (from-to)831-873
Number of pages43
JournalInternational Journal of Foundations of Computer Science
Issue number6-7
StatePublished - 1 Sep 2019

Bibliographical note

Publisher Copyright:
© 2019 World Scientific Publishing Company.


  • Automata
  • complexity
  • minimization
  • regular languages
  • sensing
  • ω-regular languages


Dive into the research topics of 'Sensing as a Complexity Measure'. Together they form a unique fingerprint.

Cite this