Loading...
Please wait, while we are loading the content...
Similar Documents
Regular Sensing
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Almagor, Shaull Kuperberg, Denis Kupferman, Orna |
| 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. |
| File Format | |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | sensing minimization ω-regular languages regular languages complexity Automata info Computer Science [cs] Formal Languages and Automata Theory [cs.FL] |
| Content Type | Text |
| Resource Type | Article |
