Finite acceptance of infinite words

DOI10.1016/S0304-3975(96)00006-0MaRDI QIDQ1269902zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3972187
• Accepting conditions for automata on -languages
• Alternating finite automata on -words
• Acceptance Conditions for ω-Languages
• \(X\)-automata on \(\omega\)-words

Cites work

• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 4039337 (Why is no real title available?)
• scientific article; zbMATH DE number 3471986 (Why is no real title available?)
• scientific article; zbMATH DE number 3525042 (Why is no real title available?)
• scientific article; zbMATH DE number 3566723 (Why is no real title available?)
• scientific article; zbMATH DE number 3572138 (Why is no real title available?)
• scientific article; zbMATH DE number 512868 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3255438 (Why is no real title available?)
• A note on \(\omega\)-regular languages
• Accepting conditions for automata on -languages
• Adherences of languages
• Decision problems forω-automata
• Finite automata and the logic of one-place predicates
• Language-theoretical representations of \(\omega\)-languages
• On ω-regular sets
• Projection lemmas for -languages
• Testing and generating infinite sequences by a finite automaton
• \(X\)-automata on \(\omega\)-words

Cited in

(9)

• Local rule distributions, language complexity and non-uniform cellular automata
• Blind counter automata on \(\omega\)-words
• \(X\)-automata on \(\omega\)-words
• On the power of reading the whole infinite input tape
• scientific article; zbMATH DE number 4143462 (Why is no real title available?)
• Somewhat finite approaches to infinite sentences.
• Completeness results for omega-regular algebras
• On alternating \(\omega\)-automata
• scientific article; zbMATH DE number 3972187 (Why is no real title available?)

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)