Further remarks on the complexity of regulated rewriting
Jürgen Dassow, Gheorghe Păun (1985)
Kybernetika
Similarity:
Displaying similar documents to “Syntactic complexity of regulated rewriting”
Further remarks on the complexity of regulated rewriting
On the generative capacity of colonies
Gheorghe Păun (1995)
Kybernetika
Similarity:
Contribution to deterministic top-down analysis of context-free languages
Karel Čulík II (1968)
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.