Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Image Analysis

ICPIA 1992: Parallel Image Analysis pp 133–143Cite as

A characterization of recognizable picture languages

  • Communications
  • Conference paper
  • First Online:

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

Abstract

This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo (1991), is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura (1977). By using this result, we then solve open problems in Giammarresi and Restivo (1991), and show that (i) REC is not closed under complementation, and (ii) REC properly contains the family of picture languages accepted by two-dimensional nondeterministic finite automata even over a one letter alphabet.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Blum and C.Hewitt, “Automata on a 2-dimensional tape”, IEEE Symp. on Switching and Automata Theory: 155–160 (1967).

    Google Scholar 

  2. S.Eilenberg, “Automata, Languages and Machines”, vol.A, Academic Press (1974).

    Google Scholar 

  3. D.Giammarresi and A.Restivo, “Recognizable picture languages”, Proc. of the International Colloquium on Parallel Image Processing (edited by M.Nivat,A.Saoudi and P.S.P.Wang), Paris, 3–16 (1991).

    Google Scholar 

  4. K.Inoue and A.Nakamura, “Some properties of two-dimensional on-line tessellation acceptors”, Information Sciences 13, 95–121 (1977).

    Google Scholar 

  5. K.Inoue and A.Nakamura, “Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel sequential array acceptors”, IEIC Japan Trans.(E), 475–476 (Sept. 1977).

    Google Scholar 

  6. K.Inoue and A.Nakamura, “Two-dimensional finite automata and unacceptable functions”, Int.J.Comput.Math.Sec.A7, 207–213 (1979).

    Google Scholar 

  7. K.Inoue and I.Takanami, “A survey of two-dimensional automata theory”, Information Sciences 55, 99–121 (1991).

    Google Scholar 

  8. A.Rosenfeld, “Picture Languages (Formal Models for Picture Recognition)”, Academic Press, New York, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems Engineering Faculty of Engineering, Yamaguchi University, 755, Ube, Japan

    Katsushi Inoue & Itsuo Takanami

Authors
  1. Katsushi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Itsuo Takanami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Akira Nakamura Maurice Nivat Ahmed Saoudi Patrick S. P. Wang Katsushi Inoue

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inoue, K., Takanami, I. (1992). A characterization of recognizable picture languages. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-56346-6_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56346-4

  • Online ISBN: 978-3-540-47538-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation