Abstract
In this paper we review some of the recently obtained results that form the basis of a new framework for considering grammars and machines.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aalbersberg, IJ.J., Rozenberg, G., "CTS systems and Petri nets", Theoretical Computer Science, to appear
Büchi, R., "Regular Canonical systems", Archv. für Mathematische Logik und Grundlagenforschung, v.6, pp. 91–111, 1964.
Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G., "Real-time coordinated pair systems", Dept. of Computer Science, University of Colorado at Boulder, Tech. Rep. No. CU-CS-259-83, 1983.
Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G., "Computations in coordinated pair systems", Dept. of Computer Science, University of Colorado at Boulder, Techn. Rep. No. CU-CS-260-84, 1984.
Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G., "Coordinated pair systems; Part I: Dyck words and classical pumping", Dept. of Computer Science University of Colorado at Boulder, Techn. Rep. No. CU-CS-275-84, 1984.
Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G., "Coordinated pair systems; Part II: Sparse structure of Dyck words and Ogden's lemma", Dept. of Computer Science, University of Colorado at Boulder, Techn. Rep. No. CU-CS-276-84, 1984.
"Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G., "On the active records of the use of memory in right-boundary grammars and push-down machines", Dept. of Computer Science, University of Colorado at Boulder, Techn. Rep. No. CU-CS-298-85, 1985.
Ehrenfeucht, A., Hoogeboom, H.J. and Rozenberg, G, "On the full records of the use of memory in right-boundary grammars and push-down machines", Dept. of Computer Science, University of Colorado at Boulder, Techn. Rep. No. CU-CS-299-85, 1985.
Ehrenfeucht, A. and Rozenberg, G., "A note on regular canonical systems" Dept. of Computer Science, University of Colorado at Boulder, Techn. Rep. No. CU-CS-279-84, 1984.
Goldstine, J., "Formal languages and their relation to automata: what Hopcroft and Ullman didn't tell us" in R. Book, ed., Formal language theory Perspectives and open problems. Academic Press, New York, 1980.
Harrison, M., Introduction to formal language theory, Addison-Welsey Publ. Co., Reading, Massachusetts, 1978.
Kleijn, H.C.M. and Rozenberg, G., "Context-free like restrictions on selective rewriting", Theoretical Computer Science, v.16, pp. 237–269, 1981.
Ogden, W.F., "A helpful result for proving inherent ambiguity", Mathematical Systems Theory, v.2, pp. 191–194, 1968.
Rozenberg, G., "Selective substitution grammars (towards a framework for rewriting systems) Part I: Definitions and Examples", Elektron. Informations verarbeit. Kybernetik 13, 455–463, 1977.
Rozenberg, G., "On coordinated selective substitutions: Towards a unified theory of grammars and machines", Theoretical Computer Science, Vol. 37, 1985.
Salomaa, A., Theory of Automata, Pergamon Press, Oxford, 1969.
Salomaa, A., Formal languages, Academic Press, London-New York, 1973.
Siromoney, R. and Krithivasan, K., "Parallel context-free languages", Inform. Contr. v.24, pp. 155–162, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G. (1985). On coordinated rewriting. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028796
Download citation
DOI: https://doi.org/10.1007/BFb0028796
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive