Bottom-up rewriting for words and terms
From MaRDI portal
Publication:741256
DOI10.1016/j.jsc.2014.06.001zbMath1456.68072OpenAlexW1665784093MaRDI QIDQ741256
Irène Durand, Géraud Sénizergues
Publication date: 11 September 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.06.001
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of some extended word problems defined by cancellation rules
- Bottom-up rewriting for words and terms
- On the rational subset problem for groups.
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Monadic Thue systems
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- Decidability for left-linear growing term rewriting systems.
- Match-bounded string rewriting systems
- Decidable call-by-need computations in term rewriting
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Tree automata for rewrite strategies
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
- Decidable approximations of term rewriting systems
- Bottom-Up Rewriting Is Inverse Recognizability Preserving
- Tree generating regular systems
- Term Rewriting and Applications
This page was built for publication: Bottom-up rewriting for words and terms