Operational state complexity of nested word automata

Authors:
Xiaoxue Piao;Kai Salomaa
Affiliations:
School of Computing, Queens University, Kingston, Ontario K7L 3N6, Canada;School of Computing, Queens University, Kingston, Ontario K7L 3N6, Canada
Venue:
Theoretical Computer Science
Year:
2009

Citing 19
Cited 8

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
Regular languages

Handbook of formal languages, vol. 1
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
On the state complexity of reversals of regular languages

Theoretical Computer Science
Automata for XML---A survey

Journal of Computer and System Sciences
State Complexity: Recent Results and Open Problems

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Marrying words and trees

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Streaming tree automata

Information Processing Letters
Adding nesting structure to words

Journal of the ACM (JACM)
Nondeterministic state complexity of nested word automata

Theoretical Computer Science
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic caterpillar expressions

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Regularity problems for visibly pushdown languages

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Congruences for visibly pushdown languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Adding nesting structure to words

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

Nondeterministic state complexity of nested word automata

Theoretical Computer Science
Limitations of lower bound methods for deterministic nested word automata

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
State complexity of operations on input-driven pushdown automata

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
State complexity of the concatenation of regular tree languages

Theoretical Computer Science
Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Fundamenta Informaticae
Input-Driven stack automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We introduce techniques to prove lower bounds for the number of states needed by finite automata operating on nested words. We study the state complexity of Boolean operations and obtain lower bounds that are tight within an additive constant. The results for union and complementation differ from corresponding bounds for ordinary finite automata. For reversal and concatenation, we establish lower bounds that are of a different order than the worst-case bounds for ordinary finite automata.