Finite acceptance of infinite words
From MaRDI portal
Publication:1269902
DOI10.1016/S0304-3975(96)00006-0zbMATH Open0902.68102MaRDI QIDQ1269902FDOQ1269902
Authors: Igor Litovsky, Ludwig Staiger 
Publication date: 22 October 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- Title not available (Why is that?)
- Decision problems forω-automata
- \(X\)-automata on \(\omega\)-words
- On ω-regular sets
- A note on \(\omega\)-regular languages
- Adherences of languages
- Accepting conditions for automata on \(\omega\)-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language-theoretical representations of \(\omega\)-languages
- Finite automata and the logic of one-place predicates
- Projection lemmas for \(\omega\)-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Local rule distributions, language complexity and non-uniform cellular automata
- Blind counter automata on \(\omega\)-words
- On the power of reading the whole infinite input tape
- \(X\)-automata on \(\omega\)-words
- Title not available (Why is that?)
- Somewhat finite approaches to infinite sentences.
- Completeness results for omega-regular algebras
- On alternating \(\omega\)-automata
- Title not available (Why is that?)
This page was built for publication: Finite acceptance of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269902)
