On derivation languages corresponding to context-free grammars

DOI10.1007/BF00288639zbMATH Open0268.68033OpenAlexW2025206446MaRDI QIDQ2563017FDOQ2563017

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Associate languages and derivational complexity of formal grammars and languages

Cited In (11)

• A note on the inclusion problem for szilard languages^†
• On the complexity of Szilard languages of regulated grammars
• On some derivation mechanisms and the complexity of their Szilard languages
• Notes on canonical label languages
• The grammatical inference problem for the Szilard languages of linear grammars
• On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
• Two decidability results for deterministic pushdown automata
• On homomorphic images of left szilard languages
• Ranking and unranking left szilard languages
• Derivation languages of grammar forms†
• Title not available (Why is that?)

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

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