On degrees of ambiguity for Büchi tree automata
From MaRDI portal
Publication:2051784
DOI10.1016/j.ic.2021.104750OpenAlexW3158485464MaRDI QIDQ2051784
Doron Tiferet, Alexander Rabinovich
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104750
Cites Work
- Choice functions and well-orderings over the infinite binary tree
- Rational \(\omega\)-languages are non-ambiguous
- Succinct representation of regular languages by Boolean automata
- On the degree of ambiguity of finite automata
- On finitely ambiguous Büchi automata
- Complementation of finitely ambiguous Büchi automata
- On the finite degree of ambiguity of finite tree automata
- Operations on Unambiguous Finite Automata
- Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Ambiguity, Nondeterminism and State Complexity of Finite Automata
- Unambiguity in Automata Theory
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On degrees of ambiguity for Büchi tree automata
