Right-linear half-monadic term rewrite systems

DOI10.1016/S0304-3975(03)00239-1zbMath1070.68058MaRDI QIDQ1884902

Sándor Vágvölgyi

Publication date: 27 October 2004

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

zbMATH Keywords

ConvergenceTerminationPreservation of recognizabilityTerm rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Murg term rewrite systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Termination of term rewriting using dependency pairs
• Proving termination with multiset orderings
• Decidability of confluence and termination of monadic term rewriting systems

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