Intersection and union of regular languages and state complexity
Information Processing Letters
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 3
Handbook of Formal Languages
Automata theory for XML researchers
ACM SIGMOD Record
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
A Second Course in Formal Languages and Automata Theory
A Second Course in Formal Languages and Automata Theory
Estimation of state complexity of combined operations
Theoretical Computer Science
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 5.23 |
Tree automata operating on unranked trees use regular languages, called horizontal languages, to define the transitions of the vertical states that define the bottom-up computation of the automaton. It is well known that the deterministic tree automaton with smallest total number of states, that is, number of vertical states and number of states used to define the horizontal languages, is not unique and it is hard to establish lower bounds for the total number of states. By relying on existing bounds for the size of unambiguous finite automata, we give a lower bound for the size blow-up of determinizing a nondeterministic unranked tree automaton. The lower bound improves the earlier known lower bound that was based on an ad hoc construction.