Sensing as a complexity measure

Shaull Almagor, Denis Kuperberg, Orna Kupferman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
EditorsGiovanni Pighizzini, Cezar Campeanu
Number of pages13
StatePublished - 2017
Event19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy
Duration: 3 Jul 20175 Jul 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10316 LNCS


Conference19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this