Skip to main content
SpringerLink
Log in

Recognizability of Triangular Picture Languages by Triangular Wang Automata

  • Conference paper
  • First Online:
Proceedings of the Third International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 258))

Abstract

Wang automata to recognize rectangular picture languages and iso-picture languages were studied in [6, 7]. In this paper we introduce triangular Wang automata based on triangular Wang tiles to recognize triangular picture languages. We discuss scanning strategies and prove that triangular Wang automata with a specific scanning strategy recognize the class of triangular pictures recognized by triangular tiling systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable two-dimensional languages. Theor. Inf. Appl. 40(2), 277–293 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Proceedings of the DLT 2007, Lecture Notes in Computer Science, vol. 4588, pp. 36–47. Springer, Heidelberg (2007)

    Google Scholar 

  3. Anselmo, M., Giammarresi, D., Madonia, M.: Tiling automaton: a computational model for recognizable two-dimensional languages. In: Proceedings of the CIAA 2007, Lecture Notes in Computer Science, vol. 4783, pp. 290–302 (2007)

    Google Scholar 

  4. Devi Rajaselvi, V., Kalyani, T., Thomas, D.G.: Domino recognizability of triangular picture languages. Int. J. Comput. Appl. 57(15), 0975–8887 (2012)

    Google Scholar 

  5. Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Inf. Sci. 55(1–3), 99–121 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kalyani, T., Dare, V.R., Thomas, D.G.: Recognizability of iso-picture languages by Wang systems. Int. J. Imaging Syst. Technol. (Wiley Publications) 19, 140–145 (2009)

    Google Scholar 

  7. Lonati, V., Pradella, M.: Deterministic recognizability of picture languages with Wang automata. Discrete Math. Theor. Comput. Sci. 4, 73–94 (2010)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sathyabama University, Chennai, 600119, India

    V. Devi Rajaselvi

  2. Department of Mathematics, St. Joseph’s Institute of Technology, Chennai, 600119, India

    T. Kalyani

  3. Department of Mathematics, Madras Christian College, Chennai, 600059, India

    V. R. Dare & D. G. Thomas

Authors
  1. V. Devi Rajaselvi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Kalyani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. R. Dare
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. Devi Rajaselvi .

Editor information

Editors and Affiliations

  1. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Millie Pant

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  3. Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  4. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Rajaselvi, V.D., Kalyani, T., Dare, V.R., Thomas, D.G. (2014). Recognizability of Triangular Picture Languages by Triangular Wang Automata. In: Pant, M., Deep, K., Nagar, A., Bansal, J. (eds) Proceedings of the Third International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 258. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1771-8_42

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1771-8_42

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1770-1

  • Online ISBN: 978-81-322-1771-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation