scientific article; zbMATH DE number 1512707

zbMATH Open0957.03047MaRDI QIDQ4508396FDOQ4508396

Authors: Olivier Carton, Max Michel 

Publication date: 3 October 2000

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

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

zbMATH Keywords

infinite wordsword recognitionunambiguityrational setBüchi automata

Mathematics Subject Classification ID

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

Cited In (19)

• Unambiguous constrained automata
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2003
• Title not available (Why is that?)
• Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
• Backward Deterministic Büchi Automata on Infinite Words
• Markov chains and unambiguous Büchi automata
• Unambiguous Büchi automata.
• Unambiguous constrained automata
• Title not available (Why is that?)
• Equivalence and inclusion problem for strongly unambiguous Büchi automata
• Title not available (Why is that?)
• Abstract interpretation from Büchi automata
• Weight assignment logic
• Title not available (Why is that?)
• On finitely ambiguous Büchi automata
• Improved upper and lower bounds for Büchi disambiguation
• Unambiguous automata
• Complementation, Disambiguation, and Determinization of Büchi Automata Unified

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)