Nothing Special   »   [go: up one dir, main page]

Skip to main content

The Power of Hybridity and Context Free in HP System

  • Conference paper
  • First Online:
Innovations in Bio-Inspired Computing and Applications

Abstract

In this paper a new computing model called Hybrid P System is introduced and examined. The aim is to elaborate the power of hybrid P system with prescribed teams and context-free puzzle grammar rules in generating characters. Various non-context free sets of arrays that can be generated in a simple way by hybrid context-free puzzle grammar system with prescribed teams working in different modes are presented in [12]. We show the power of the mechanism of hybridity for picture description on P system.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Similar content being viewed by others

References

  1. Ceterchi, R., Mutyam, M., Paun, Gh, Subramanian, K.G.: Array rewriting P systems. Nat. Comput. 2, 229–249 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Csuhaj-Varj, E., Dassow, J., Kelemen, J., Paun, Gh.: Grammar Systems: A grammatical approach to distribution and cooperation, Gordon and Breach Science Publishers, Topics in Computer Mathematics 5, Yverdon (1994)

    Google Scholar 

  3. Dassow, J., Freund, R., Paun, Gh: Cooperating array grammar system. Int. J. Pattern Recogn. Artif. Intell. 9, 1–25 (1995)

    Article  Google Scholar 

  4. Fernau, H. Freund, R.: Bounded Parallelism in Array Grammars Used for Character Recognition, In: Perner, P., Wang, P., Rosenfeld, A. (eds.), Advances in Structural and Syntactical Pattern Recognition (Proceedings of the SSPR’96), vol. 1121, pp. 40–49 Springer, Berlin (1996)

    Google Scholar 

  5. Helen Chandra, P., Saroja, K., Theerdus, S.M.: Array P Systems with Hybrid Teams. BIC-TA. In: Advances in Intelligent Systems and Computing 201, vol. 1, pp. 239–249(2013), Springer (2012)

    Google Scholar 

  6. Kari, L., Mateescu, A., Paun, Gh, Salomaa, A.: Teams in cooperating grammar systems. J. Exper. Th. AI 7, 347–359 (1995)

    Article  MATH  Google Scholar 

  7. Laroche, P., Nivat, M., Saoudi, A.: Context-sensitivity of puzzle grammars. Lect. Notes Comput. Sci. 654, 195–212 (1992)

    Article  MathSciNet  Google Scholar 

  8. Nivat, M., Saoudi, A., Subramanian, K.G., Siromoney, R., Dare, V.R.: Puzzle grammars and context-free array grammars. Int. J. Pattern Recogn. Artif. Intell. 5, 663–676 (1991)

    Article  Google Scholar 

  9. Paun, Gh, Rosenbrg, G.: Prescribd teams of grammars. Acta Informatica 31, 525–537 (1994)

    Article  MathSciNet  Google Scholar 

  10. Paun, Gh: Membrane Computing: An introduction. Springer, Berlin (2002)

    Book  MATH  Google Scholar 

  11. ter Maurice, H.: Beek: Teams in grammar systems: hybridity and weak rewriting. Acta cybernetica 12, 427–444 (1996)

    MathSciNet  Google Scholar 

  12. Grammars, Hybrid Context-free Puzzle: In: Saroja Theerdus Kalavathy, S.M., Helen Chandra, P. (eds,) Proceedings of the International Conference On Mathematics in Engineering and Business Management, vol. II, pp. 33–38 (2012)

    Google Scholar 

  13. Siromoney, R., Huq, A., Chandrasekaran, M., Subramanian, K.G.: Stochstic Puzzle grammars. Int. J. Pattern Recogn. Artif. Intell. 6, 257–273 (1992)

    Article  Google Scholar 

  14. Subramanian, K.G., Revathi, L., Siromoney, R.: Siromoney array grammars and applications. Int. J. Pattern Recogn. Artif. Intell. 3, 333–351 (1989)

    Article  Google Scholar 

  15. Subramanian, K.G., Siromoney, R., Dare, V.R., Saoudi, A.: Basic puzzle languages. Int. J. Pattern Recogn. Artif. Intell. 5, 763–775 (1995)

    Article  Google Scholar 

  16. Subramanian, K.G., Thomas, D.G., Helen Chandra, P., Hoeberechts, M.: Basic puzzle grammars and generation of polygons. J. Automata Lang. Comb. 6, 555–568 (2001)

    MathSciNet  MATH  Google Scholar 

  17. Subramanian, K.G., Saravanan, R., Helen Chandra, P.: Cooperating basic puzzle grammar systems. Lecture Notes in Computer Science 4040, pp. 354–360. Springer (2006)

    Google Scholar 

  18. Subramanian, K.G., Saravanan, R., Geethalakshmi, M., Helen Chandra, P.: P systems with array objects and array rewriting rules. Prog. Nat. Sci. 17, 479–485 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Helen Chandra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kalavathy, S.M.S.T., Chandra, P.H., Kalyani, M.N. (2016). The Power of Hybridity and Context Free in HP System. In: Snášel, V., Abraham, A., Krömer, P., Pant, M., Muda, A. (eds) Innovations in Bio-Inspired Computing and Applications. Advances in Intelligent Systems and Computing, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-319-28031-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28031-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28030-1

  • Online ISBN: 978-3-319-28031-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics