Regular sensing

Shaull Almagor, Denis Kuperberg, Orna Kupferman

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

7 Scopus citations

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 show that for finite words, size and sensing are related, and minimal sensing is attained by minimal automata. Thus, a unique minimal-sensing deterministic automaton exists, and is based on the language's right-congruence relation. For infinite words, the minimal sensing may be attained only by an infinite sequence of automata. We show that the optimal limit cost of such sequences can be characterized by the language's right-congruence relation, which enables us to find the sensing cost of ω-regular languages in polynomial time.

Original languageAmerican English
Title of host publication34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014
EditorsVenkatesh Raman, S. P. Suresh
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages161-173
Number of pages13
ISBN (Electronic)9783939897774
DOIs
StatePublished - 1 Dec 2014
Event34th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2014 - New Delhi, India
Duration: 15 Dec 201417 Dec 2014

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume29
ISSN (Print)1868-8969

Conference

Conference34th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2014
Country/TerritoryIndia
CityNew Delhi
Period15/12/1417/12/14

Keywords

  • Automata
  • Complexity
  • Minimization
  • Regular languages
  • Sensing
  • ω-regular languages

Fingerprint

Dive into the research topics of 'Regular sensing'. Together they form a unique fingerprint.

Cite this