Controlled Term Rewriting

DOI10.1007/978-3-642-24364-6_13zbMath1348.68083OpenAlexW1666446684MaRDI QIDQ3172893

Florent Jacquemard, Masahiko Sakai, Yoshiharu Kojima

Publication date: 7 October 2011

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ Unnamed Item ⋮ One-variable context-free hedge automata ⋮ Applications and extensions of context-sensitive rewriting

Uses Software

• Timbuk

Cites Work

• Reachability analysis over term rewriting systems
• Deleting string rewriting systems preserve regularity
• Flow analysis of lazy higher-order functional programs
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Typechecking for XML transformers
• Decidability for left-linear growing term rewriting systems.
• Query automata over finite trees
• Decidable call-by-need computations in term rewriting
• Context-sensitive rewriting strategies
• Tree automata for rewrite strategies
• Pushdown tree automata
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• Visibly Pushdown Languages and Term Rewriting
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Top-down tree transducers with regular look-ahead
• Term Rewriting and All That
• One-sided and two-sided context in formal grammars
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Monadic datalog and the expressive power of languages for Web information extraction
• Classes of languages and linear-bounded automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Controlled Term Rewriting