Epsilon weak precedence grammars and languages
Masoud T. Milani, David A. Workman (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Masoud T. Milani, David A. Workman (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J. Duske, M. Middendorf, R. Parchmann (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Viliam Geffert (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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.
Dan A. Simovici (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
G. Păun (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
S. A. Greibach (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: