Marrying Words and Trees

DOI10.1007/978-3-540-79980-1_1MaRDI QIDQ5505411zbMATH OpenOpenAlexFDO

Authors Rajeev Alur

Publication date 27 January 2009

Published in Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79980-1_1

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

(15)

• Efficient determinization of visibly and height-deterministic pushdown automata
• Colored nested words
• Multi-matching nested relations
• The (nested) word problem
• Rewriting systems over nested data words
• Alternation elimination for automata over nested words
• Adding nesting structure to words
• Marrying Words and Trees
• Model Checking: From Tools to Theory
• Adding Nesting Structure to Words
• First-Order and Temporal Logics for Nested Words
• Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
• Languages of Nested Trees
• Streaming tree 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 Q5505411)