Solutions to four open problems concerning controlled pure grammar systems

DOI10.1080/00207160.2013.829214MaRDI QIDQ2921920zbMATH OpenOpenAlexFDO

Authors Alexander Meduna, Lukáš Vrábel, Petr Zemek

Publication date 14 October 2014

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2013.829214

zbMATH Keywords

formal languagesregular languageserasing rulespure grammar systemscontrolled leftmost derivations

Mathematics Subject Classification ID

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

Recommendations

• Controlled pure grammar systems
• scientific article; zbMATH DE number 3990893
• scientific article; zbMATH DE number 4001502
• On Controlled P Systems
• scientific article; zbMATH DE number 1244205

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 814824 (Why is no real title available?)
• A note on pure grammars
• Determination of finite automata accepting subregular languages
• Elements of compiler design.
• On the leftmost derviation in matrix grammars
• One-sided random context grammars with leftmost derivations
• Pure grammars
• Regulated grammars under leftmost derivation

Cited in

(1)

• Controlled pure grammar systems

This page was built for publication: Solutions to four open problems concerning controlled pure grammar systems

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