Bottom-up rewriting for words and terms

DOI10.1016/J.JSC.2014.06.001MaRDI QIDQ741256zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

term rewriting systemsregularity preservationaccessibility problemsemi-Thue systems

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• Word Matrix Rewriting Systems
• Left-linear bounded TRSs are inverse recognizability preserving
• 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

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)