On rationally controlled one-rule insertion systems
From MaRDI portal
Publication:5044416
DOI10.1051/ita/2022008OpenAlexW4306858188MaRDI QIDQ5044416
Publication date: 31 October 2022
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2022008
Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the regular structure of prefix rewriting
- Deleting string rewriting systems preserve regularity
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Termination proofs for string rewriting systems via inverse match-bounds
- Some decision problems about controlled rewriting systems
- Transductions des langages de Chomsky
- Match-bounded string rewriting systems
- On prefixal one-rule string rewrite systems
- Decidability of Termination of Grid String Rewriting Rules
- On Regularity-Preservation by String-Rewriting Systems
- Semi-Thue systems with an inhibitor
This page was built for publication: On rationally controlled one-rule insertion systems