On rationally controlled one-rule insertion systems
From MaRDI portal
Recommendations
Cites work
- Decidability of termination of grid string rewriting rules
- Deleting string rewriting systems preserve regularity
- Elements of automata theory. Translated from the French by Reuben Thomas
- scientific article; zbMATH DE number 4205992 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3684913 (Why is no real title available?)
- scientific article; zbMATH DE number 3786151 (Why is no real title available?)
- Match-bounded string rewriting systems
- On one-rule grid semi-Thue systems
- On prefixal one-rule string rewrite systems
- On Regularity-Preservation by String-Rewriting Systems
- On the regular structure of prefix rewriting
- Semi-Thue systems with an inhibitor
- Some decision problems about controlled rewriting systems
- Termination proofs for string rewriting systems via inverse match-bounds
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Transductions des langages de Chomsky
Cited in
(3)
This page was built for publication: On rationally controlled one-rule insertion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044416)