Marrying Words and Trees

DOI10.1007/978-3-540-74510-5_3MaRDI QIDQ3499762zbMATH OpenOpenAlexFDO

Authors Rajeev Alur

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Marrying Words and Trees
• Trees in many contexts
• Sturmian words, Lyndon words and trees
• scientific article; zbMATH DE number 1195746
• Trees and learning
• On trees and characters
• scientific article; zbMATH DE number 1925192
• scientific article; zbMATH DE number 790410
• Trees and decisions

Cited in

(29)

• On regular tree languages and deterministic pushdown automata
• Efficient inclusion checking for deterministic tree automata and XML schemas
• Visibly pushdown transducers
• Consensus string problem for multiple regular languages
• Colored nested words
• Operator precedence temporal logic and model checking
• Multi-matching nested relations
• Operational state complexity of nested word automata
• Visibly rational expressions
• The (nested) word problem
• Rewriting systems over nested data words
• Edit-distance between visibly pushdown languages
• Adding nesting structure to words
• Model Checking: From Tools to Theory
• Adding Nesting Structure to Words
• State Complexity of Nested Word Automata
• Bounded Delay and Concurrency for Earliest Query Answering
• First-Order and Temporal Logics for Nested Words
• Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
• Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
• Marrying Words and Trees
• Queries on XML streams with bounded delay and concurrency
• Languages of Nested Trees
• Earliest query answering for deterministic stepwise hedge automata
• Evolving schemas for streaming XML
• Visibly linear temporal logic
• Rewriting of visibly pushdown languages for XML data integration
• Visibly recursive automata
• Paired bondage in trees

This page was built for publication: Marrying Words and Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499762)