2026-08-18T17:42:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4840 2024-03-06T10:35:24Z ddc:004 open_access

Regular Sensing Almagor, Shaull Kuperberg, Denis Kupferman, Orna Automata regular languages omega-regular languages complexity sensing minimization 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 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 omega-regular languages in polynomial time. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Shaull Almagor and Denis Kuperberg and Orna Kupferman 2014 Is Part Of LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2014.161 urn:nbn:de:0030-drops-48409 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.161 eng https://creativecommons.org/licenses/by/3.0/legalcode