On degrees of ambiguity for Büchi tree automata
From MaRDI portal
Publication:2051784
Recommendations
Cites work
- Ambiguity, nondeterminism and state complexity of finite automata
- Choice functions and well-orderings over the infinite binary tree
- Complementation of finitely ambiguous Büchi automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Expressing cardinality quantifiers in monadic second-order logic over trees
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 7559451 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- On finitely ambiguous Büchi automata
- On the degree of ambiguity of finite automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the finite degree of ambiguity of finite tree automata
- Operations on Unambiguous Finite Automata
- Rational \(\omega\)-languages are non-ambiguous
- Succinct representation of regular languages by Boolean automata
- Unambiguity in automata theory
Cited in
(11)- On finitely ambiguous Büchi automata
- On the finite degree of ambiguity of finite tree automata
- On finite and polynomial ambiguity of weighted tree automata
- Equivalence and inclusion problem for strongly unambiguous Büchi automata
- scientific article; zbMATH DE number 4094825 (Why is no real title available?)
- scientific article; zbMATH DE number 17556 (Why is no real title available?)
- scientific article; zbMATH DE number 1512707 (Why is no real title available?)
- Markov chains and unambiguous Büchi automata
- On the strength of unambiguous tree automata
- Ambiguity hierarchy of regular infinite tree languages
- Unambiguity in automata theory
This page was built for publication: On degrees of ambiguity for Büchi tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051784)
