GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA

DOI10.1142/S0129054106004352MaRDI QIDQ5493904zbMATH OpenOpenAlexFDO

Authors Zbyněk Křivka, Alexander Meduna, Rudolf Schönecker

Publication date 16 October 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106004352

zbMATH Keywords

finite indexinfinite hierarchyprogrammed grammars{\#}-rewriting systems

Mathematics Subject Classification ID

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

Recommendations

• Comparison of basic language generating devices (non-deterministic systems)
• A note on parallel rewriting in P systems
• scientific article; zbMATH DE number 992013
• Rewriting P systems with flat-splicing rules
• Word Matrix Rewriting Systems

Cites work

• A hierarchy between context-free and context-sensitive languages
• Accepting grammars with regulation
• scientific article; zbMATH DE number 1330031 (Why is no real title available?)
• On state-alternating context-free grammars

Cited in

(6)

• Automata generated p-languages
• The finite index restriction meets hybrid modes in cooperating distributed grammar systems
• On the Efficient Generation of Language Instances
• Comparison of basic language generating devices (non-deterministic systems)
• Generative languages, codes and parallel processing
• Automatically Generated Infrastructure for De Bruijn Syntaxes

This page was built for publication: GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493904)