Symbol different term rewrite systems
From MaRDI portal
Publication:492918
DOI10.1016/J.JLAMP.2015.06.005zbMATH Open1332.68105OpenAlexW1100208954MaRDI QIDQ492918FDOQ492918
Authors: Sándor Vágvölgyi 
Publication date: 21 August 2015
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.06.005
Recommendations
- scientific article; zbMATH DE number 1368955
- scientific article; zbMATH DE number 3870642
- Reversible term rewriting
- Extended term rewriting systems
- scientific article; zbMATH DE number 8327
- scientific article; zbMATH DE number 4090779
- scientific article; zbMATH DE number 1889386
- Murg term rewrite systems
- Term Rewriting and Applications
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40)
Cites Work
- Title not available (Why is that?)
- Variations on the Common Subexpression Problem
- Title not available (Why is that?)
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Implementing term rewriting by jungle evaluation
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- Term rewriting restricted to ground terms.
- Restricted ground tree transducers
- Decidable call-by-need computations in term rewriting
- Derivation trees of ground term rewriting systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability analysis of term rewriting systems with Timbuk
- Title not available (Why is that?)
- Congruences generated by extended ground term rewrite systems
- Finer Is Better: Abstraction Refinement for Rewriting Approximations
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Title not available (Why is that?)
- Left-linear bounded TRSs are inverse recognizability preserving
- Reachability analysis over term rewriting systems
- On tree automata that certify termination of left-linear term rewriting systems
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
Cited In (1)
Uses Software
This page was built for publication: Symbol different term rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492918)
