scientific article; zbMATH DE number 3990900

MaRDI QIDQ3753512zbMATH OpenFDO

Authors André Arnold

Publication date 1985

zbMATH Keywords

rational languagenon-ambiguitydeterministic Büchi automatadeterministic Muller automatarational \(\omega \)-languagetopology on the set of infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Unambiguous Büchi automata.
• Topology and ambiguity in \(\omega\)-context free languages
• Ambiguity of -languages of Turing machines
• scientific article; zbMATH DE number 1866912
• scientific article; zbMATH DE number 1512707

Cited in

(19)

• scientific article; zbMATH DE number 3868650 (Why is no real title available?)
• Context-Sensitive Languages, Rational Graphs and Determinism
• scientific article; zbMATH DE number 1866912 (Why is no real title available?)
• The determinacy strength of pushdownω-languages
• Nonstandard approach to general rational languages
• scientific article; zbMATH DE number 2095527 (Why is no real title available?)
• Wadge Degrees ofω-Languages of Deterministic Turing Machines
• scientific article; zbMATH DE number 1962805 (Why is no real title available?)
• The greatest fixed-points and rational omega-tree languages
• Markov chains and unambiguous automata
• Saturating right congruences
• A syntactic congruence for rational -languages
• scientific article; zbMATH DE number 5051550 (Why is no real title available?)
• Projection lemmas for -languages
• scientific article; zbMATH DE number 1670861 (Why is no real title available?)
• Rational languages defined with a non-associative concatenation
• From LTL to unambiguous Büchi automata via disambiguation of alternating automata
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
• A topological property of rational -languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753512)