Bottom-up rewriting for words and terms

DOI10.1016/J.JSC.2014.06.001zbMATH Open1456.68072OpenAlexW1665784093MaRDI QIDQ741256FDOQ741256

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

Recommendations

• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Left-linear bounded TRSs are inverse recognizability preserving
• Foundations of Software Science and Computation Structures
• Termination of linear bounded term rewriting systems
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems

zbMATH Keywords

term rewriting systemsregularity preservationaccessibility problemsemi-Thue systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Cites Work

• Decidable approximations of term rewriting systems
• Title not available (Why is that?)
• Finite derivation type implies the homological finiteness condition \(FP_ 3\)
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Tree generating regular systems
• Decidable call-by-need computations in term rewriting
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Title not available (Why is that?)
• On the complexity of some extended word problems defined by cancellation rules
• Monadic Thue systems
• RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
• Title not available (Why is that?)
• On the rational subset problem for groups.
• Decidability for left-linear growing term rewriting systems.
• Tree automata for rewrite strategies
• Term Rewriting and Applications
• Match-bounded string rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Bottom-up rewriting for words and terms

Cited In (5)

• Bottom-up tree pushdown automata and rewrite systems
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Bottom-up rewriting for words and terms
• Foundations of Software Science and Computation Structures
• Word Matrix Rewriting Systems

This page was built for publication: Bottom-up rewriting for words and terms

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