n-reconstructability of context-free grammars

DOI10.1016/0020-0190(76)90081-8zbMath0337.68055OpenAlexW2045562002MaRDI QIDQ1230514

Dino Mandrioli

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90081-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Grammatical Inference: Introduction and Survey - Part I
• Parenthesis Grammars
• Associate languages and derivational complexity of formal grammars and languages

This page was built for publication: n-reconstructability of context-free grammars