On derivation languages corresponding to context-free grammars

DOI10.1007/BF00288639zbMath0268.68033OpenAlexW2025206446MaRDI QIDQ2563017

Martti Penttonen

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288639

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

On homomorphic images of left szilard languages ⋮ Unnamed Item ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ The grammatical inference problem for the Szilard languages of linear grammars ⋮ A note on the inclusion problem for szilard languages^† ⋮ On some derivation mechanisms and the complexity of their Szilard languages ⋮ Ranking and unranking left szilard languages ⋮ Notes on canonical label languages ⋮ Two decidability results for deterministic pushdown automata ⋮ On the Complexity of Szilard Languages of Regulated Grammars ⋮ Derivation languages of grammar forms†

Cites Work

• Unnamed Item
• Associate languages and derivational complexity of formal grammars and languages

This page was built for publication: On derivation languages corresponding to context-free grammars