Descriptional complexity measures of context-free languages
Anton Černý (1983)
Kybernetika
Similarity:
Anton Černý (1983)
Kybernetika
Similarity:
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.
Miroslav Novotný (1974)
Kybernetika
Similarity:
Karel Čulík II (1968)
Kybernetika
Similarity: