Termination of linear bounded term rewriting systems
From MaRDI portal
Recommendations
- Left-linear bounded TRSs are inverse recognizability preserving
- Linear bounded automata and rewrite systems: influence of initial configurations on decision properties
- 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
- Linear bounded automata and rewrite systems: influence of initial configurations on decision properties
- 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)