Journal of the ACM (JACM)
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On Logics, Tilings, and Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Rewriting of visibly pushdown languages for xml data integration
Proceedings of the 17th ACM conference on Information and knowledge management
Information Processing Letters
Adding nesting structure to words
Journal of the ACM (JACM)
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Operational state complexity of nested word automata
Theoretical Computer Science
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Proceedings of the VLDB Endowment
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Evolving schemas for streaming XML
Theoretical Computer Science
Evolving schemas for streaming XML
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Hi-index | 0.00 |
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this paper, we argue that nested words and automata over nested words offer a better way to capture and process the dual structure. Nested words generalize both words and ordered trees, and allow both word and tree operations. We study various classes of automata over nested words, and show that while they enjoy expressiveness and succinctness benefits over word and tree automata, their analysis complexity and closure properties are analogous to the corresponding word and tree special cases. In particular, we show that finite-state nested word automata can be exponentially more succinct than tree automata, and pushdown nested word automata include the two incomparable classes of context-free word languages and context-free tree languages.