When Stars Control a Grammar's Work

DOI10.4204/eptcs.386.9arXiv2309.02755OpenAlexW4386399981MaRDI QIDQ6204128

Henning Fernau, Indhumathi Raman, Lakshmanan Kuppusamy

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.02755

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent developments on insertion-deletion systems
• Contextual insertions/deletions and computability
• Matrix insertion-deletion systems
• On the computational power of insertion-deletion systems
• Marcus contextual grammars
• On path-controlled insertion-deletion systems
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Insertion-Deletion Systems with One-Sided Contexts
• Normal forms for phrase-structure grammars
• Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems
• About One-Sided One-Symbol Insertion-Deletion P Systems
• On the generative capacity of matrix insertion-deletion systems of small sum-norm

This page was built for publication: When Stars Control a Grammar's Work