A combinatorial approach to the theory of ω-automata
From MaRDI portal
Publication:3934375
DOI10.1016/S0019-9958(81)90663-XzbMath0478.03020MaRDI QIDQ3934375
Publication date: 1981
Published in: Information and Control (Search for Journal in Brave)
homogeneous setsomega-automatacounter free omega-automatadefinability of sequence-sets in first-order and monadic second-order logicomega-regular sequence-setssets of infinite sequences recognized by finite automata
Formal languages and automata (68Q45) Model theory (03C99) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25)
Related Items (18)
Towards a language theory for infinite N-free pomsets. ⋮ Infinite-word languages and continuous mappings ⋮ Progress measures, immediate determinacy, and a subset construction for tree automata ⋮ Somewhat finite approaches to infinite sentences. ⋮ Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) ⋮ Determinization of ordinal automata ⋮ Composition Over the Natural Number Ordering with an Extra Binary Relation ⋮ On the translation of automata to linear temporal logic ⋮ Quantitative vs. weighted automata ⋮ Completing the temporal picture ⋮ Generalized automata on infinite trees and Muller-McNaughton's theorem ⋮ \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets ⋮ LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Unnamed Item ⋮ Various hierarchies of \(\omega\)-regular sets ⋮ Logic, semigroups and automata on words ⋮ Decidability and undecidability of theories with a predicate for the primes
This page was built for publication: A combinatorial approach to the theory of ω-automata
