Skip to main content

P Systems with External Input and Learning Strategies

  • Conference paper
  • 314 Accesses

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

Abstract

This is a preliminary work in which we propose a variant of P systems by adding in every region a dynamic engine that allows the change of the internal rewriting rules along the computation time, obtaining in this way a new family of P systems with adaptation to changing environments. They will be called adaptative P systems. Here, the engine that we propose to act inside every membrane is based on learning algorithms under the grammatical inference framework. The behavior of every region changes according to the information received from the external environment and the internal regions.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Besozzi, D., Mauri, G., Păun, G., Zandron, C.: Gemmating P systems: collapsing hierarchies. Theoretical Computer Science 296, 253–267 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Calude, C., Păun, G.: Computing with Cells and Atoms. Taylor & Francis, Abington (2001)

    MATH  Google Scholar 

  3. Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset automata. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 65–83. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  5. Freund, R.: Generalized P-systems. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 281–292. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison Wesley Publishing Co., Reading (1979)

    MATH  Google Scholar 

  7. Madhu, M., Krithivasan, K.: A note on hybryd P systems. Grammars 5, 239–244 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Martín-Vide, C., Păun, G., Pazos, J., Rodríguez-Patón, A.: Tissue P systems. Theoretical Computer Science 296, 295–326 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane systems with carriers. Theoretical Computer Science 270, 779–796 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Oncina, J., García, P.: Inferring regular languages in polynomial update time. Series in Machine Perception and Artificial Intelligence (1): Pattern Recognition and Image Analysis. World Scientific, Singapore (1992)

    Google Scholar 

  11. Osherson, D., Stob, M., Weinstein, S.: Systems that Learn. MIT Press, Cambridge (1986)

    Google Scholar 

  12. Porat, S., Feldman, J.: Learning automata from ordered examples. Machine Learning 7, 109–138 (1991)

    MATH  Google Scholar 

  13. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  14. Păun, G., Yokomori, T.: Membrane computing based on splicing. In: Winfree, E., Gifford, D. (eds.) Proceedings of the DIMACS Workshop DNA Based Computers V. DIMACS series, vol. 54, pp. 217–231. American Mathematical Society, Providence (2000)

    Google Scholar 

  15. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)

    Google Scholar 

  16. Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185, 15–45 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sempere, J.M., García, P.: A new regular language learning algorithm from lexicographically ordered complete samples. In: Lucas, S. (ed.) Proceedings Colloquium on Grammatical Inference: Theory, Applications and Alternatives, as IEE Digest number 1993/092, pp. 6/1-6/7 (1993)

    Google Scholar 

  18. Trakhtenbrot, B., Barzdin, Y.: Finite Automata: Behavior and Synthesis. North Holland Publishing Company, Amsterdam (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sempere, J.M. (2004). P Systems with External Input and Learning Strategies. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24619-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20895-2

  • Online ISBN: 978-3-540-24619-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics