Pure grammars and pure languages†

DOI10.1080/00207168108803224zbMath0454.68097OpenAlexW1987379642MaRDI QIDQ3902533

A. Gabrielian

Publication date: 1981

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

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

zbMATH Keywords

Turing machinessemi-Thue systemPost canonical systems

Mathematics Subject Classification ID

Related Items (12)

A note on pure grammars ⋮ Comparison of basic language generating devices (non-deterministic systems) ⋮ Context-free grammars with selective rewriting ⋮ A \(P\) system model with pure context-free rules for picture array generation ⋮ On form-equivalence of deterministic pure grammar forms ⋮ Pure 2D picture grammars and languages ⋮ Some generalized semi-thue systems ⋮ Operations and language generating devices suggested by the genome evolution ⋮ Pure grammars and pure languages† ⋮ On sentential forms of context-free grammars ⋮ It is decidable whether a regular language is pure context-free ⋮ Homomorphic images of sentential form languages defined by semi-Thue systems

Cites Work

• Pure grammars
• Pure grammars and pure languages†
• Regular canonical systems
• On Relations Defined by Generalized Finite Automata
• Formal Reductions of the General Combinatorial Decision Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pure grammars and pure languages†