P Systems with External Input and Learning Strategies

  • José M. Sempere
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)


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.


Turing Machine External Input Target Language Regular Language External Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Besozzi, D., Mauri, G., Păun, G., Zandron, C.: Gemmating P systems: collapsing hierarchies. Theoretical Computer Science 296, 253–267 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Calude, C., Păun, G.: Computing with Cells and Atoms. Taylor & Francis, Abington (2001)zbMATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 4.
    Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)zbMATHCrossRefGoogle Scholar
  5. 5.
    Freund, R.: Generalized P-systems. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 281–292. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison Wesley Publishing Co., Reading (1979)zbMATHGoogle Scholar
  7. 7.
    Madhu, M., Krithivasan, K.: A note on hybryd P systems. Grammars 5, 239–244 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane systems with carriers. Theoretical Computer Science 270, 779–796 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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. 11.
    Osherson, D., Stob, M., Weinstein, S.: Systems that Learn. MIT Press, Cambridge (1986)Google Scholar
  12. 12.
    Porat, S., Feldman, J.: Learning automata from ordered examples. Machine Learning 7, 109–138 (1991)zbMATHGoogle Scholar
  13. 13.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  14. 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. 15.
    Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)Google Scholar
  16. 16.
    Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185, 15–45 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 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. 18.
    Trakhtenbrot, B., Barzdin, Y.: Finite Automata: Behavior and Synthesis. North Holland Publishing Company, Amsterdam (1973)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • José M. Sempere
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politécnica de Valencia 

Personalised recommendations