Advertisement

Parallel generation and parsing of array languages using reversible cellular automata

  • Kenichi Morita
  • Satoshi Ueno
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 654)

Abstract

We propose a new system of generating array languages in parallel, based on a partitioned cellular automaton (PCA), a kind of cellular automaton. This system is called a PCA array generator (PCAAG). The characteristic of PCAAG is that a “reversible” version is easily defined. A reversible PCA (RPCA) is a backward deterministic PCA, and we can construct a deterministic “inverse” PCA that undoes the operations of the RPCA. Thus if an array language is generated by an RPCA, it can be parsed in parallel by a deterministic inverse PCA without backtracking. We also define two subclasses of PCAAG, and give examples of them that generate geometrical figures.

Keywords

Cellular Automaton Initial Configuration Nonterminal Symbol Start Symbol Infinite Array 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook, C.R., and Wang, P.S.P., “A Chomsky hierarchy of isotonic array grammars and languages,” Computer Graphics and Image Processing, 8, 144–152 (1978).Google Scholar
  2. 2.
    Milgram, D.L., and Rosenfeld, A., “Array automata and array grammars,” Information Processing 71, 69–74 (1972).Google Scholar
  3. 3.
    Morita, K., Yamamoto, Y., and Sugata, K., “The complexity of some decision problems about two-dimensional array grammars,” Information Sciences, 30, 241–262 (1983).Google Scholar
  4. 4.
    Morita, K., and Harao, M., “Computation universality of one-dimensional reversible (injective) cellular automata,” Trans. IEICE, E-72, 758–762 (1989).Google Scholar
  5. 5.
    Morita, K., and Ueno, S., “Computation-universal models of two-dimensional 16-state reversible cellular automata,” IEICE Trans. Inf. & Syst., E75-D, 141–147 (1992).Google Scholar
  6. 6.
    Morita, K., “Computation-universality of one-dimensional one-way reversible cellular automata,” Information Processing Letters, 42, 325–329 (1992).Google Scholar
  7. 7.
    Nivat, M., Saoudi, A., and Dare, V.R., “Parallel generation of finite images,” Int. J. Pattern Recognition and Artificial Intelligence, 3, 279–294 (1989).Google Scholar
  8. 8.
    Rosenfeld, A., Picture Languages, Academic Press, New York (1979).Google Scholar
  9. 9.
    Rosenfeld, A., “Coordinate grammars revisited: generalized isometric grammars,” Int. J. Pattern Recognition and Artificial Intelligence, 3, 435–444 (1989).Google Scholar
  10. 10.
    Saoudi, A., Rangarajan, K., and Dare, V.R., “Finite images generated by GL-systems,” Int. J. Pattern Recognition and Artificial Intelligence, 3, 459–467 (1989).Google Scholar
  11. 11.
    Siromoney, G., Siromoney, R., and Krithivasan, K., “Abstract families of picture languages,” Computer Graphics and Image Processing, 1, 284–307 (1972).Google Scholar
  12. 12.
    Siromoney, G., Siromoney, R., and Krithivasan, K., “Picture languages with array rewriting rules,” Information and Control, 22, 447–470 (1973).Google Scholar
  13. 13.
    Wang, P.S.P., “Hierarchical structures and complexities of parallel isotonic array languages,” IEEE Trans., PAMI-5, 92–99 (1983).Google Scholar
  14. 14.
    Yamamoto, Y., Morita, K., and Sugata, K., “Context-sensitivity of two-dimensional regular array grammars,” Int. J. Pattern Recognition and Artificial Intelligence, 3, 295–319 (1989).Google Scholar
  15. 15.
    Yamamoto, Y., and Morita, K., “Two-dimensional uniquely parsable isometric array grammars,” Proc. Int. Colloq. Parallel Image Processing, Paris, 271–287 (1991).Google Scholar
  16. 16.
    Yamamoto, Y., and Morita, K., “Isometric array grammars which are equivalent to two-dimensional deterministic tape acceptors (in Japanese),” Research Report of Institute of Mathematical Analysis, Kyoto University, No.754, 115–124 (1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Kenichi Morita
    • 1
  • Satoshi Ueno
    • 1
  1. 1.Yamagata UniversityYonezawa-shiJapan

Personalised recommendations