Advertisement

Homomorphisms of graphs and their global maps

  • Masakazu Nasu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 108)

Keywords

Finite Type Distinct Member Distinct Path Sofic System Definite Table 
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

  1. [1]
    R.L. Adler and B. Marcus, Topological entropy and equivalence of dynamical systems, Memoirs Amer. Math. Soc. 219 (1979).Google Scholar
  2. [2]
    C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).Google Scholar
  3. [3]
    E.M. Coven and M.E. Paul, Endomorphisms of irreducible subshifts of finite type, Math. Systems Theory 8 (1974) 167–175.Google Scholar
  4. [4]
    E.M. Coven and M.E. Paul, Sofic systems, Israel J. Math. 20 (1975) 165–177.Google Scholar
  5. [5]
    E.M. Coven and M.E. Paul, Finite procedures for sofic systems, Monatsh. Math. 83 (1977) 265–278.Google Scholar
  6. [6]
    J.D. Ferguson, Some properties of mappings on sequence spaces, Ph. D. Thesis, Yale University, New Haven, CT (1962).Google Scholar
  7. [7]
    F.R. Gantmacher, The Theory of Matrices, Vol. II (Chelsea, New York, 1959).Google Scholar
  8. [8]
    F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969).Google Scholar
  9. [9]
    G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Math. Systems Theory 3 (1969) 320–375.Google Scholar
  10. [10]
    M. Nasu, Local maps inducing surjective global maps of one-dimensional tessellation automata, Math. Systems Theory 11 (1978) 327–351.Google Scholar
  11. [11]
    M. Nasu, An interconnection of local maps inducing onto global maps, Discrete Applied Math. 2 (1980) 125–150.Google Scholar
  12. [12]
    M. Nasu, Indecomposable local maps of tessellation automata, Math. Systems Theory 13 (1979) 81–93.Google Scholar
  13. [13]
    M. Nasu, Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs, submitted.Google Scholar
  14. [14]
    M. Nasu, Constant-to-one and onto global maps of homomorphisms between strongly connected graphs, in preparation.Google Scholar
  15. [15]
    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).Google Scholar
  16. [16]
    M. Perles, M.O. Rabin, and E. Shamir, The theory of definite automata, IEEE Trans. Electr. Comp. EC-12 (1963) 233–243.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Masakazu Nasu
    • 1
  1. 1.Research Institute of Electrical CommunicationTohoku UniversitySendaiJapan

Personalised recommendations