On prefixal one-rule string rewrite systems
From MaRDI portal
Publication:2330116
DOI10.1016/j.tcs.2019.07.004zbMath1435.68136MaRDI QIDQ2330116
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.07.004
68Q42: Grammars and rewriting systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A canonical automaton for one-rule length-preserving string rewrite systems
- Deleting string rewriting systems preserve regularity
- Termination proofs for string rewriting systems via inverse match-bounds
- Some decision problems about controlled rewriting systems
- A note on a special one-rule semi-Thue system
- Match-bounded string rewriting systems
- Decidability of Termination of Grid String Rewriting Rules
- On Regularity-Preservation by String-Rewriting Systems
- Iteration of rational transductions
- Non-Looping String Rewriting
- One-Rule Length-Preserving Rewrite Systems and Rational Transductions
- Term Rewriting and Applications
- Semi-Thue systems with an inhibitor
- Confluence of one-rule Thue systems