Finite acceptance of infinite words
From MaRDI portal
Publication:1269902
DOI10.1016/S0304-3975(96)00006-0zbMath0902.68102MaRDI QIDQ1269902
Publication date: 22 October 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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