Right-linear half-monadic term rewrite systems

DOI10.1016/S0304-3975(03)00239-1MaRDI QIDQ1884902zbMATH OpenFDO

Authors Sándor Vágvölgyi

Publication date 27 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(03)00239-1

zbMATH Keywords

ConvergencePreservation of recognizabilityTerm rewrite systemsTermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Automated Deduction – CADE-20
• Modular termination of \(r\)-consistent and left-linear term rewriting systems
• scientific article; zbMATH DE number 1615242
• scientific article; zbMATH DE number 1722708
• scientific article; zbMATH DE number 1118018
• Decidability of confluence and termination of monadic term rewriting systems
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 4090779
• Term Rewriting and Applications

Cites work

• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Decidability of confluence and termination of monadic term rewriting systems
• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3729436 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1380897 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• scientific article; zbMATH DE number 1405630 (Why is no real title available?)
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Proving termination with multiset orderings
• Termination of term rewriting using dependency pairs

Cited in

(3)

• scientific article; zbMATH DE number 5708984 (Why is no real title available?)
• Tail reduction free term rewriting systems revisited
• Murg term rewrite systems

This page was built for publication: Right-linear half-monadic term rewrite systems

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