scientific article; zbMATH DE number 49211
From MaRDI portal
Publication:3998014
Recommendations
Cited in
(25)- Simple termination is difficult
- On normalizing, non-terminating one-rule string rewriting systems
- Match-bounded string rewriting systems
- Left-divisibility and word problems in single relation monoids
- The word problem for one-relation monoids: a survey
- On prefixal one-rule string rewrite systems
- On termination of confluent one-rule string-rewriting systems
- On one-rule grid semi-Thue systems
- One-rule semi-Thue systems with loops of length one, two or three
- Deciding Innermost Loops
- Loops under Strategies
- A note on thue systems with a single defining relation
- Real_Impl
- Non-Looping String Rewriting
- A canonical automaton for one-rule length-preserving string rewrite systems
- Simple termination is difficult
- More problems in rewriting
- On the termination problem for one-rule semi-Thue system
- One-rule trace-rewriting systems and confluence
- Term Rewriting and Applications
- Termination and derivational complexity of confluent one-rule string-rewriting systems
- Confluence of one-rule Thue systems
- Termination of string rewriting proved automatically
- Termination proofs for string rewriting systems via inverse match-bounds
- Loop detection in term rewriting using the eliminating unfoldings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998014)
