SYNCHRONIZED EOL FORMS *
@inproceedings{Maurer2001SYNCHRONIZEDEF, title={SYNCHRONIZED EOL FORMS *}, author={Hermann A. Maurer and Arto Salomaa}, year={2001} }
We turn once more to the study of EOL forms by focussing on synchronized EOL forms. We show that there are complete propagating synchro-EOL forms in contrast to the situation for EOL forms. Turning to the syntax analysis of synchro-EOL form families, we are lead into the study of ambiguity in EOL systems. We show that there are languages which are n-CF-ambiguous, for arbitrarily large values of n 2 1, but which are EOL-unambiguous. Finally we characterize when synchro-{S, a}-forms are complete…
Figures from this paper
References
SHOWING 1-10 OF 14 REFERENCES
Synchronized EOL Forms Under Uniform Interpretation
- Computer ScienceRAIRO Theor. Informatics Appl.
- 1981
A ""strongest"" possible normaljorm resuit, the spanning normalJorm theorem; the non-existence oj uni-generatorsjor "reasonable" language amilies, which include the finite, regular and context-jree j amilies; and a char act erization oj those ynchronized jorms which, under uniform interprétation, yield all regular languages.
Context-Free Grammar Forms with Strict Interpretations
- Computer ScienceJ. Comput. Syst. Sci.
- 1980
An Introduction to Formal Language Theory
- Computer ScienceTexts and Monographs in Computer Science
- 1988
This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
The mathematical theory of L systems
- Mathematics
- 1980
A survey of the different areas of the theory of developmental systems and languages in such a way that it discusses typical results obtained in each particular problem area.
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
- Computer ScienceJACM
- 1969
A direct and self-contained proof is given of the inherent ambiguity of the context-free language L, which is the solution to an open problem pointed out by Ginsburg.
Two-symbol complete EOL forms, 27reoret
- Comput. Sci
- 1978
Two - symbol complete EOL forms , 27 reoret
- Comput . Sci .
Acta Informat
- Acta Informat
- 1977