Deciding equivalence of finite tree automata
SIAM Journal on Computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Ultimately Periodic Words of Rational w-Languages
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Theoretical Computer Science - Latin American theoretical informatics
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
MSO on the infinite binary tree: choice and order
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Efficient inclusion testing for simple classes of unambiguous ω-automata
Information Processing Letters
| Hi-index | 0.00 |
We consider the inclusion and equivalence problem for unambiguous Büchi automata. We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time. We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense. We also discuss the problems that arise when considering the decision problems for the standard notion of ambiguity for Büchi automata.