Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R.L. Adler and B. Marcus, Topological entropy and equivalence of dynamical systems, Memoirs Amer. Math. Soc. 219 (1979).
C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
E.M. Coven and M.E. Paul, Endomorphisms of irreducible subshifts of finite type, Math. Systems Theory 8 (1974) 167–175.
E.M. Coven and M.E. Paul, Sofic systems, Israel J. Math. 20 (1975) 165–177.
E.M. Coven and M.E. Paul, Finite procedures for sofic systems, Monatsh. Math. 83 (1977) 265–278.
J.D. Ferguson, Some properties of mappings on sequence spaces, Ph. D. Thesis, Yale University, New Haven, CT (1962).
F.R. Gantmacher, The Theory of Matrices, Vol. II (Chelsea, New York, 1959).
F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969).
G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Math. Systems Theory 3 (1969) 320–375.
M. Nasu, Local maps inducing surjective global maps of one-dimensional tessellation automata, Math. Systems Theory 11 (1978) 327–351.
M. Nasu, An interconnection of local maps inducing onto global maps, Discrete Applied Math. 2 (1980) 125–150.
M. Nasu, Indecomposable local maps of tessellation automata, Math. Systems Theory 13 (1979) 81–93.
M. Nasu, Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs, submitted.
M. Nasu, Constant-to-one and onto global maps of homomorphisms between strongly connected graphs, in preparation.
M. Nasu, Maps of one-dimensional tessellation automata and homomorphisms of graphs, Proc. of The Fifth IBM Symp. on Mathematical Foundations of Computer Science (1980).
M. Perles, M.O. Rabin, and E. Shamir, The theory of definite automata, IEEE Trans. Electr. Comp. EC-12 (1963) 233–243.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nasu, M. (1981). Homomorphisms of graphs and their global maps. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_14
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive