scientific article; zbMATH DE number 3990900

zbMATH Open0612.68073MaRDI QIDQ3753512FDOQ3753512

Authors: André Arnold 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (19)

• Title not available (Why is that?)
• Context-Sensitive Languages, Rational Graphs and Determinism
• Title not available (Why is that?)
• The determinacy strength of pushdownω-languages
• Nonstandard approach to general rational languages
• Title not available (Why is that?)
• Wadge Degrees ofω-Languages of Deterministic Turing Machines
• Title not available (Why is that?)
• The greatest fixed-points and rational omega-tree languages
• Markov chains and unambiguous automata
• Saturating right congruences
• Title not available (Why is that?)
• A syntactic congruence for rational \(\omega\)-languages
• Title not available (Why is that?)
• Projection lemmas for \(\omega\)-languages
• From LTL to unambiguous Büchi automata via disambiguation of alternating automata
• Rational languages defined with a non-associative concatenation
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
• A topological property of rational \(\omega\)-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)