Termination of linear bounded term rewriting systems

DOI10.4230/LIPICS.RTA.2010.341MaRDI QIDQ5389154zbMATH OpenFDO

Authors Irène Durand, Géraud Sénizergues, Marc Sylvestre

Publication date 25 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_8643.html

zbMATH Keywords

rewriting strategyterm rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Left-linear bounded TRSs are inverse recognizability preserving
• scientific article; zbMATH DE number 1638661
• Mathematical Foundations of Computer Science 2003
• Termination proofs for string rewriting systems via inverse match-bounds
• Time bounded rewrite systems and termination proofs by generalized embedding

Cited in

(9)

• Bounded, strongly sequential and forward-branching term rewriting systems
• Head boundedness of nonterminating rewritings
• scientific article; zbMATH DE number 1638661 (Why is no real title available?)
• Innermost termination of rewrite systems by labeling
• A local termination property for term rewriting systems
• Left-linear bounded TRSs are inverse recognizability preserving
• Bottom-up rewriting for words and terms
• Termination proofs for string rewriting systems via inverse match-bounds
• Termination of just/fair computations in term rewriting

This page was built for publication: Termination of linear bounded term rewriting systems

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