Work on this paper was supported in part by NSF Grant GJ 36424.
Preview
Unable to display preview. Download preview PDF.
References
Pratt, T. W., Pair grammars, graph languages and string-to-graph translations, J. Computer and System Sc., 5(1971), 560–595.
Ng, P. A., Hsia, P., and Yeh, R. T., Finite graph automata, right-linear graph grammars and regular sets, Proc. Conference on Formal Language, Automata and Development, Noordwijderhout, The Netherlands, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, P.A., Hsia, P., Yeh, R.T. (1975). Graph walking automata. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_217
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_217
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive