@inproceedings{c88cee2da6564d7889143b8eab826e28,
title = "Regular sensing",
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.",
keywords = "Automata, Complexity, Minimization, Regular languages, Sensing, ω-regular languages",
author = "Shaull Almagor and Denis Kuperberg and Orna Kupferman",
year = "2014",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.FSTTCS.2014.161",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "161--173",
editor = "Venkatesh Raman and Suresh, {S. P.}",
booktitle = "34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014",
address = "גרמניה",
note = "34th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2014 ; Conference date: 15-12-2014 Through 17-12-2014",
}