scientific article; zbMATH DE number 1512707

MaRDI QIDQ4508396zbMATH OpenFDO

Authors Olivier Carton, Max Michel

Publication date 3 October 2000

zbMATH Keywords

Büchi automatainfinite wordsrational setunambiguityword recognition

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Unambiguous Büchi automata.
• Mathematical Foundations of Computer Science 2003
• On finitely ambiguous Büchi automata
• Unambiguous Büchi Is Weak
• On degrees of ambiguity for Büchi tree automata

Cited in

(20)

• Unambiguous Büchi automata.
• On finitely ambiguous Büchi automata
• Unambiguous constrained automata
• Weight assignment logic
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified
• Equivalence and inclusion problem for strongly unambiguous Büchi automata
• scientific article; zbMATH DE number 3990900 (Why is no real title available?)
• scientific article; zbMATH DE number 4094825 (Why is no real title available?)
• scientific article; zbMATH DE number 177837 (Why is no real title available?)
• Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
• Markov chains and unambiguous Büchi automata
• Abstract interpretation from Büchi automata
• scientific article; zbMATH DE number 1866912 (Why is no real title available?)
• Efficient analysis of unambiguous automata using matrix semigroup techniques
• Backward Deterministic Büchi Automata on Infinite Words
• Improved upper and lower bounds for Büchi disambiguation
• scientific article; zbMATH DE number 5279417 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Unambiguous constrained automata
• Unambiguous automata

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