On some constructions of grammars for linear languages
From MaRDI portal
This paper explains generalized linear grammars, that is, infinitely many linear productions are allowed. The author then demonstrates that for restricted versions of these grammars (and languages), it is possible to give general constructions that given a language produce a grammar that generates it. These results are, therefore, a contribution to the theory of grammatical inference.
Recommendations
Cites work
- Algebraic linguistics; analytical models
- scientific article; zbMATH DE number 3251418 (Why is no real title available?)
- scientific article; zbMATH DE number 3299741 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
- On an Effective Construction of a Grammar Generating a Given Language
- On certain formal properties of grammars
- The theory of configurations in algebraic linguistics
- Three models for the description of language
Cited in
(15)- Inference of even linear grammars and its application to picture description languages
- A note on the equivalence and complexity of linear grammars
- A direct complement construction for LR(1) grammars
- On the existence of generators of a CF-grammar for an arbitrary linear Diophantine system
- On an Effective Construction of a Grammar Generating a Given Language
- scientific article; zbMATH DE number 4043267 (Why is no real title available?)
- scientific article; zbMATH DE number 4096798 (Why is no real title available?)
- scientific article; zbMATH DE number 4112043 (Why is no real title available?)
- scientific article; zbMATH DE number 68511 (Why is no real title available?)
- scientific article; zbMATH DE number 845930 (Why is no real title available?)
- A grammatical inference for harmonic linear languages
- scientific article; zbMATH DE number 3230265 (Why is no real title available?)
- A COMPLEX MEASURE FOR LINEAR GRAMMARS
- Derived linear systems of context-free grammars
- The grammatical inference problem for the Szilard languages of linear grammars
This page was built for publication: On some constructions of grammars for linear languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3732973)