Skip to main content

Context-sensitivity of puzzle grammars

  • Communications
  • Conference paper
  • First Online:
Parallel Image Analysis (ICPIA 1992)

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

Included in the following conference series:

Abstract

We study some properties of axray grammars, called puzzle grammars, introduced in [NS89].We give a new method, using puzzle grammar, for generating the set of rectangles. We prove the the emptiness problem for puzzle grammar is undecidable. We show that the non-overlapping problem for puzzle grammar is decidable.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Danielle Beauquier, An undecidable problem about rationnal sets and contour words of polyominoes, Inf. Process. Letters. Vol 37 n 5 (March 1991), 257–263.

    Google Scholar 

  2. D. Beauquier, M. Nivat, About rationnal subset of algebras of infinite words, in Automata, Languages and programming (W. Brauer ed.), LNCS, u 192, Springer-Verlag, Berlin (1985) 33–42.

    Google Scholar 

  3. C.R. Cook and P.S.P. Wang, Chomsky hierarchy of isotonic array grammars and languages, Computer Graphics and Image Proccesing 8(1978) 144–152.

    Google Scholar 

  4. K. Inoue, I. Sakuramoto, M. Sakamoto and I. Takanami, Two Topics concerning Two-dimensionnal Automata Operating in Parallel, Proc. of the First Int. Conf. on Parallel Image Processing, (1991) 231–262.

    Google Scholar 

  5. K. Morita, Y. Yamamoto and K. Sugata, The Complexity of some Decision Problems about Array Grammars, Inf. Sciences, 30 (1983)241–262.

    Google Scholar 

  6. M.Nivat, A. Saoudi, K.G. Subramanian, R. Siromoney and V.R. Dare, Puzzle Grammars and Context-Free Array Grammars, Int. J. of Pattern Recognition and Art. Int., vol 5, n 5 (1992) 663–675.

    Google Scholar 

  7. M. Nivat, A. Saoudi, Notes on Puzzle Grammars, unpublished (1989).

    Google Scholar 

  8. M. Nivat, A. Saoudi,Parallel Recognition of High Dimensionnal Images, Proc. of the First Int. Conf. on Parallel Image Processing, (1991) 123–130.

    Google Scholar 

  9. W.Rytter, A. Saoudi,Pn parallel Recognition of Two Classes of 2D-Array Patterns, Proc. of the First Int. Conf. on Parallel Image Processing, (1991) 153–160.

    Google Scholar 

  10. A. Rosenfeld, Isotonic Grammars, Parallel Grammars and Picture Languages, in Machine Intelligence (B. Meltzer and D. Michie, Eds), Univ. of Edinburgh Press (1971)

    Google Scholar 

  11. A. Rosenfeld, Array Grammars normal forms, Informations and Control 23(1973)173–182

    Google Scholar 

  12. A. Rosenfeld, Picture languages: formal models for picture recognition, Academic Press 1979.

    Google Scholar 

  13. Y. Yamamoto, K.Morita and K. Sutaga, Context-sensitivity of two-dimentionnal regular array grammars, Int. J. of Pattern Recognition and Art. Int. vol. 3&4 (1989)295–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Laroche, P., Nivat, M., Saoudi, A. (1992). Context-sensitivity of puzzle grammars. 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_39

Download citation

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

  • 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