On Regularity-Preservation by String-Rewriting Systems

DOI10.1007/978-3-540-88282-4_32zbMath1156.68432OpenAlexW1851409572MaRDI QIDQ3540126

Peter Leupold

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

On rationally controlled one-rule insertion systems ⋮ On prefixal one-rule string rewrite systems

Cites Work

• Unnamed Item
• Unnamed Item
• Deleting string rewriting systems preserve regularity
• On regularity of languages generated by copying systems
• Languages generated by iterated idempotency
• On the regularity of languages on a binary alphabet generated by copying systems
• Closure of Language Classes Under Bounded Duplication
• Algebraic Theory of Automata and Languages
• General Idempotency Languages Over Small Alphabets

This page was built for publication: On Regularity-Preservation by String-Rewriting Systems