Marrying Words and Trees
From MaRDI portal
Publication:3499762
DOI10.1007/978-3-540-74510-5_3zbMath1167.68379OpenAlexW1559554095MaRDI QIDQ3499762
Publication date: 3 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_3
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Visibly pushdown transducers ⋮ Earliest query answering for deterministic stepwise hedge automata ⋮ Edit-Distance Between Visibly Pushdown Languages ⋮ Evolving schemas for streaming XML ⋮ Operator precedence temporal logic and model checking ⋮ Visibly rational expressions ⋮ Visibly linear temporal logic ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Operational state complexity of nested word automata ⋮ Rewriting of visibly pushdown languages for XML data integration ⋮ State Complexity of Nested Word Automata ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Consensus string problem for multiple regular languages ⋮ On regular tree languages and deterministic pushdown automata ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas
