On star height hierarchies of context-free languages
Jozef Gruska (1973)
Kybernetika
Similarity:
Jozef Gruska (1973)
Kybernetika
Similarity:
Jürgen Dassow, Victor Mitrana, Gheorghe Păun, Ralf Stiebe (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We introduce the notion of a differentiation function of a context-free grammar which gives the number of terminal words that can be derived in a certain number of steps. A grammar is called narrow (or -narrow) iff its differentiation function is bounded by a constant (by ). We present the basic properties of differentiation functions, especially we relate them to structure function of context-free languages and narrow grammars to slender languages. We discuss the decidability of the...
Miroslav Novotný (1974)
Kybernetika
Similarity:
J. Albert (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Gheorghe PăUN (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: