On an Effective Construction of a Grammar Generating a Given Language

DOI10.1075/LLSEE.17.13NOVzbMATH Open0546.68058OpenAlexW2506093337MaRDI QIDQ3336719FDOQ3336719

Authors Miroslav Novotný

Publication date 1983

Published in Prague Studies in Mathematical Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1075/llsee.17.13nov

zbMATH Keywords

linear grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On some constructions of grammars for linear languages
• scientific article; zbMATH DE number 68528
• A grammatical inference for harmonic linear languages
• Grammatical Inference: Introduction and Survey-Part I
• scientific article; zbMATH DE number 3970121

Cited in

(11)

• On the Efficient Generation of Language Instances
• scientific article; zbMATH DE number 3907799 (Why is no real title available?)
• scientific article; zbMATH DE number 3970121 (Why is no real title available?)
• On the number of rules needed for the automaton grammar to generate a finite language
• scientific article; zbMATH DE number 68528 (Why is no real title available?)
• An optimal construction of Hanf sentences
• scientific article; zbMATH DE number 1904851 (Why is no real title available?)
• scientific article; zbMATH DE number 68511 (Why is no real title available?)
• On some constructions of grammars for linear languages
• scientific article; zbMATH DE number 139623 (Why is no real title available?)
• How to produce all sentences from a two-level grammar

This page was built for publication: On an Effective Construction of a Grammar Generating a Given Language

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