Controlled term rewriting

DOI10.1007/978-3-642-24364-6_13MaRDI QIDQ3172893zbMATH OpenOpenAlexFDO

Authors Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai

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)

Recommendations

• Term rewriting with prefix context constraints and bottom-up strategies
• Constrained term rewriting tooL
• Towards an Efficient Implementation of Tree Automata Completion
• scientific article; zbMATH DE number 1354853
• Reachability in conditional term rewriting systems

Cites work

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

Cited in

(12)

• scientific article; zbMATH DE number 1234886 (Why is no real title available?)
• scientific article; zbMATH DE number 1231662 (Why is no real title available?)
• scientific article; zbMATH DE number 4052984 (Why is no real title available?)
• One-variable context-free hedge automata
• Confluence of prefix-constrained rewrite systems
• Constrained term rewriting tooL
• Attenuation Regulation as a Term Rewriting System
• Tree Pattern Rewriting Systems
• Senescent ground tree rewrite systems
• Term rewriting with prefix context constraints and bottom-up strategies
• scientific article; zbMATH DE number 1231542 (Why is no real title available?)
• Applications and extensions of context-sensitive rewriting

Describes a project that uses

Uses Software

• Timbuk

This page was built for publication: Controlled term rewriting

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