Skip to main content
SpringerLink
Log in

Cellular graph automata

  • List Of Contributions
  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science and Biology (Graph Grammars 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 73))

Abstract

Labelled graphs of bounded degree, with numbers assigned to the arcs at each node, are called d-graphs. A class of generalized automata, called cellular d-graph automata, in which the intercell connections define a d-graph, is introduced. It can be shown that a cellular d-graph automaton can measure various properties of its underlying graph; can detect graph or subgraph isomorphism; and can recognize various basic types of graphs. Most of these tasks can be performed in time proportional to the diameter of the given graph. Closure properties of d-graph languages are also briefly discussed.

The support of the U.S. Air Force Office of Scientific Research under Grant AFOSR-77-3271 is gratefully acknowledged, as is the help of Ms. Kathryn Riley in preparing this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. S. Shank, Graph property recognition machines, Math. Systems Theory 5, 1971, 45–49.

    Google Scholar 

  2. D. L. Milgram, Web automata, Information and Control 29, 1975, 162–184.

    Google Scholar 

  3. A. Rosenfeld and D. L. Milgram, Web automata and web grammars. In B. Meltzer and D. Michie, eds., Machine Intelligence 7, Edinburgh U. Press, 1972, 307–324.

    Google Scholar 

  4. J. Mylopoulos and T. Pavlidis, On the topological properties of quantized spaces, JACM 18, 1971, 239–254.

    Google Scholar 

  5. P. Rosenstiehl, J. R. Fiksel, and A. Holliger, Intelligent Graphs: Networks of Finite Automata Capable of Solving Graph Problems. In R. C. Read, ed., Graph Theory and Computing, Academic Press, New York, 1972, 219–265.

    Google Scholar 

  6. A. N. Shah, D. L. Milgram and A. Rosenfeld, Parallel web automata, University of Maryland Computer Science Center Technical Report 231, 1973.

    Google Scholar 

  7. A. Rosenfeld, Networks of Automata — some applications, IEEE Trans. SMC-5, 1975, 380–383.

    Google Scholar 

  8. A. Wu, Cellular graph automata, Ph.D dissertation, University of Maryland, 1978.

    Google Scholar 

References

  1. A. Aho, J.E. Hopcroft and J.D. Ullman (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.

    Google Scholar 

  2. A.K. Chandra and L.J. Stockmeyer (1976), "Alternation," Proc. 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas, 98–108.

    Google Scholar 

  3. S.A. Cook and R.A. Reckhow (1973), "Time Bounded Random Access Machines," JCSS 7, 354–375.

    Google Scholar 

  4. L.M. Goldschlager (1977), "Synchronous Parallel Computation," Ph.D. Thesis, Computer Science, University of Toronto.

    Google Scholar 

  5. L.M. Goldschlager (1978), "A Unified Approach to Models of Synchronous Parallel Machines," Proc. 10th ACM Symposium on Theory of Computing, San Diego, CA 89–94.

    Google Scholar 

  6. J. Hartmanis and J. Simon (1974), "On the Power of Multiplication in Random Access Machines," Proc. 15th IEEE Symposium Switching and Automation Theory, New Orleans, 13–23.

    Google Scholar 

  7. D. Kozen (1976), "On Parallelism in Turing Machines," Proc. 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas, 89–97.

    Google Scholar 

  8. V.R. Pratt and L.J. Stockmeyer (1976), "A Characterization of the Power of Vector Machines," JCSS 12, 198–221.

    Google Scholar 

  9. W.J. Savitch (1978), "Parallel and Nondeterministic Time Complexity Classes," in G. Ausiello and C. Böhm (Eds.), Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, Springer-Verlag, 411–424.

    Google Scholar 

  10. W.J. Savitch and M.J. Stimson (1976), "The Complexity of Time Bounded Recursive Computations," Proc. Conf. on Information Sciences and Systems, The Johns Hopkins University.

    Google Scholar 

  11. W.J. Savitch and M.J. Stimson (1978), "Time Bounded Random Access Machines with Parallel Processing," JACM (in press).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Center, University of Maryland, 20742, College Park, MD

    Angela Wu & Azriel Rosenfeld

Authors
  1. Angela Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Azriel Rosenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Claus Hartmut Ehrig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, A., Rosenfeld, A. (1979). Cellular graph automata. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025742

Download citation

  • DOI: https://doi.org/10.1007/BFb0025742

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09525-5

  • Online ISBN: 978-3-540-35091-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation