Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of formal languages, vol. 3
Ultimate-Definite and Symmetric-Definite Events and Automata
Journal of the ACM (JACM)
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Duality and Equational Theory of Regular Languages
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Fragments of First-Order Logic over Infinite Words
Theory of Computing Systems
Canonical decomposition of a regular factorial language
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean combinations. These properties include effective algebraic characterizations and lattice identities. In the main part of this paper we consider the following deterministic one-way automaton models: unions of flip automata, weak automata, and Staiger-Wagner automata. We show that each of these models is expressively complete for regular Boolean combination of right ideals. Right ideals over finite words resemble the open sets in the Cantor topology over infinite words. An omega-regular language is a Boolean combination of open sets if and only if it is recognizable by a deterministic Staiger- Wagner automaton; and our result can be seen as a finitary version of this classical theorem. In addition, we also consider the canonical automaton models for right ideals, prefix-closed languages, and factorial languages. In the last section, we consider a two-way automaton model which is known to be expressively complete for two-variable first-order logic. We show that the above concepts can be adapted to these two-way automata such that the resulting languages are the right ideals (resp. prefix-closed languages, resp. Boolean combinations of right ideals) definable in twovariable first-order logic.