Finite acceptance of infinite words

DOI10.1016/S0304-3975(96)00006-0zbMath0902.68102MaRDI QIDQ1269902

Igor Litovsky, Ludwig Staiger

Publication date: 22 October 1998

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

zbMATH Keywords

finite automatafinite acceptance of infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Local rule distributions, language complexity and non-uniform cellular automata

Cites Work

• Projection lemmas for \(\omega\)-languages
• A note on \(\omega\)-regular languages
• Accepting conditions for automata on \(\omega\)-languages
• Language-theoretical representations of \(\omega\)-languages
• Adherences of languages
• \(X\)-automata on \(\omega\)-words
• On ω-regular sets
• Decision problems forω-automata
• Finite automata and the logic of one-place predicates
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite acceptance of infinite words