Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Authors:
Xiaoxue Piao;Kai Salomaa
Affiliations:
School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada. {piao, ksalomaa}@cs.queensu.ca;(Correspd.) (Research supported in part by the Natural Sciences and Engineering Research Council of Canada) School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada. {piao, ksalo ...
Venue:
Fundamenta Informaticae
Year:
2011

Citing 19
Cited 6

Regular languages

Handbook of formal languages, vol. 1
Tree languages

Handbook of formal languages, vol. 3
Automata theory for XML researchers

ACM SIGMOD Record
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
Static analysis of xml transformation and schema languages

Static analysis of xml transformation and schema languages
Automata for XML---A survey

Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
State complexity of basic language operations combined with reversal

Information and Computation
A Second Course in Formal Languages and Automata Theory

A Second Course in Formal Languages and Automata Theory
Adding nesting structure to words

Journal of the ACM (JACM)
Descriptional and Computational Complexity of Finite Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Estimation of state complexity of combined operations

Theoretical Computer Science
Operational state complexity of nested word automata

Theoretical Computer Science
Efficient inclusion checking for deterministic tree automata and XML Schemas

Information and Computation
Descriptional complexity of unambiguous nested word automata

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
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

State complexity of the concatenation of regular tree languages

Theoretical Computer Science
State complexity of kleene-star operations on trees

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of projection and quotient on unranked trees

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On state complexity of finite word and tree languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Lower bounds for the size of deterministic unranked tree automata

Theoretical Computer Science
Tree shuffle

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic definition of determinism introduced by Cristau et al. (FCT'05, LNCS 3623, pp. 68-79). We establish upper and lower bounds for the state complexity of conversions between different types of unranked tree automata.