Deterministic Caterpillar Expressions

Salomaa, Kai; Yü, Sheng; Zan, Jinfeng

doi:10.1007/978-3-540-76336-9_11

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nested words capture models where there is both a linear sequencing of positions and a hierarchical matching of nested positions, like in XML documents where each open tag is matched with a corresponding closing tag. While trees and tree automata are often used as models of XML, see [19,23,24], nested word automata may be more natural for this task, especially when the document needs to be processed sequentially. It can be noted that, by interpreting trees as special cases of nested words, (restricted) nested word automata can be used to define regular tree languages [1,4].…”

Section: Introductionmentioning

confidence: 99%

Operational state complexity of nested word automata

Piao

Salomaa

2009

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

a b s t r a c tWe 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.

show abstract