On the role of configurations in the theory of grammars
Miroslav Novotný (1970)
Archivum Mathematicum
Similarity:
Displaying similar documents to “A grammatical inference for -finite languages”
On the role of configurations in the theory of grammars
Two theorems about Galiukschov semicontextual languages
Gheorghe Păun (1985)
Kybernetika
Similarity:
Comments on effective and unambiguous context-free languages
Eduard Kostolanský (1969)
Kybernetika
Similarity:
Weightreducing grammars and ultralinear languages
Ulrike Brandt, Ghislain Delepine, Hermann K.-G. Walter (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We exhibit a new class of grammars with the help of weightfunctions. They are characterized by decreasing the weight during the derivation process. A decision algorithm for the emptiness problem is developed. This class contains non-contextfree grammars. The corresponding language class is identical to the class of ultralinear languages.