\(X\)-automata on \(\omega\)-words

DOI10.1016/0304-3975(93)90349-XzbMath0777.68058MaRDI QIDQ1210539

Joost Engelfriet, Hendrik Jan Hoogeboom

Publication date: 30 August 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\omega\)-words; finite-state automata; \(\omega\)-languages; real-time automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Finite acceptance of infinite words, On syntactic congruences for \(\omega\)-languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Look-ahead on pushdowns
• Finite-state \(\omega\)-languages
• Projection lemmas for \(\omega\)-languages
• Characterization of \(\omega\)-regular languages by first-order formulas
• Adherences of languages
• A decidability result for deterministic \(\omega\)-context-free languages
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• \(\omega\)-computations on Turing machines
• \(\omega\)-computations on deterministic pushdown machines
• Remarks on blind and partially blind one-way multicounter machines
• Two characterizations of rational adherences
• Infinite behaviour of Petri nets
• Some definitional suggestions for automata theory
• Sequential mappings of $\omega $-languages
• Rekursive Folgenmengen I
• On ω-regular sets
• On ω-sets associated with context-free languages
• An Approach to a Unified Theory of Automata
• Decision problems forω-automata
• Studies in abstract families of languages
• Testing and generating infinite sequences by a finite automaton