Degrees of Ambiguity for Parity Tree Automata (original) (raw)
Related papers
On the finite degree of ambiguity of finite tree automata
Acta Informatica, 1989
Degrees of Ambiguity of Büchi Tree Automata
2019
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing, 1999
On the degree of ambiguity of finite automata
Theoretical Computer Science, 1991
Complexity of Some Problems from the Theory of Automata
Operations on Unambiguous Finite Automata
Developments in Language Theory, 2016
Ambiguity Hierarchy of Regular Infinite Tree Languages
2020
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
Descriptional and computational complexity of finite automata—A survey
Information and Computation, 2011
On the complexity of the syntax of tree languages
Lecture Notes in Computer Science, 2009
Parikh Automata over Infinite Words
arXiv (Cornell University), 2022
A new decidable problem, with applications
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977
Completeness results concerning systolic tree automata and E0L languages
Information Processing Letters, 1995
The Turing degree of the inherent ambiguity problem for context-free languages
Theoretical Computer Science, 1975
Some Decision Questions Concerning the Time Complexity of Language Acceptors
Completeness Results Concerning Systolic Tree Automata and EOL Languages
Ipl, 1995
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Deciding Equivalence of Finite Tree Automata
SIAM Journal on Computing, 1990
On the expressiveness of Parikh automata and related models
On the complexity of membership and counting in height-deterministic pushdown automata
Computer ScienceTheory and …, 2008
Alternating two-way AC-tree automata
Information and Computation, 2007
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science, 2005
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
IEEE Symposium on Foundations of Computer Science, 1991
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science, 1998
Bounds for Tree Automata with Polynomial Costs
J. Autom. Lang. Comb., 2005
On the Representation of Finite Automata
Corr, 2009
On complete systems of automata
Theoretical Computer Science, 2000
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science, 2009
Non-uniform automata over groups
Information and Computation, 1990
On Helping by Parity-Like Languages
Information Processing Letters, 1995
Finite tree automata with cost functions
Theoretical Computer Science, 1994
On the Descriptional Complexity of Simple RL-Automata
2006
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
International Journal of Foundations of Computer Science
Acta Cybernetica, 2006