Advertisement

P Automata: Concepts, Results, and New Aspects

  • Erzsébet Csuhaj-Varjú
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5957)

Abstract

In this paper we discuss P automata, constructs combining properties of classical automata and P systems being in interaction with their environments. We describe the most important variants and their properties, and propose new topics and open problems for future research.

Keywords

Regular Language Rule Application Language Class Nest Data Input Tape 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alhazov, A.: Minimizing evolution-communication P systems and EC P automata. In: Cavaliere, M., et al. (eds.) Brainstorming Week on Membrane Computing. Technical Report 26/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, pp. 23–31 (2003)Google Scholar
  2. 2.
    Bel-Enguix, G., Gramatovici, R.: Parsing with active P automata. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 31–42. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Bel-Enguix, G., Gramatovici, R.: Parsing with P automata. In: Ciobanu, G., Păun, Gh., Pérez-Jiménez, M.J. (eds.) Applications of Membrane Computing, pp. 389–410. Springer, Berlin (2006)Google Scholar
  4. 4.
    Björklund, H., Bojanczyk, M.: Shuffle expressions and words with nested data. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 750–761. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Cardelli, L.: Brane calculi. Interactions of biological membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–280. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Cienciala, L., Ciencialova, L.: Membrane automata with priorities. Journal of Computer Science and Technology 19(1), 89–97 (2004)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Ciobanu, G., Gontineac, V.M.: Mealy multiset automata. International Journal of Foundations of Computer Science 17, 111–126 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Ciobanu, G., Gontineac, V.M.: P machines: An automata approach to membrane computing. In: Hoogeboom, H.-J., et al. (eds.) WMC 2006. LNCS, vol. 4361, pp. 314–329. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Ciobanu, G., Păun, Gh., Stefănescu, G.: P transducers. New Generation Computing 24(1), 1–28 (2006)zbMATHCrossRefGoogle Scholar
  10. 10.
    Csuhaj-Varjú, E.: P automata. In: Mauri, G., Păun, Gh., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 19–35. Springer, Heidelberg (2005)Google Scholar
  11. 11.
    Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, Gy.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 77–90. Springer, Heidelberg (2005)Google Scholar
  12. 12.
    Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, Gy.: On the computational complexity of P automata. Natural Computing 5(2), 109–126 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Csuhaj-Varjú, E., Oswald, M., Vaszil, Gy.: P automata. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) Handbook of Membrane Computing. Oxford University Press, Oxford (to appear) Google Scholar
  14. 14.
    Csuhaj-Varjú, E., Vaszil, Gy.: P automata. In: Păun, G., Zandron, C. (eds.) Pre-Proceedings of the Workshop on Membrane Computing WMC-CdeA 2002, Curtea de Argeş, Romania, August 19-23, Pub. No. 1 of MolCoNet-IST-2001-32008, pp. 177–192 (2002)Google Scholar
  15. 15.
    Csuhaj-Varjú, E., Vaszil, Gy.: P automata or purely communicating accepting P systems. In: Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    Csuhaj-Varjú, E., Vaszil, Gy.: (Mem)brane automata. Theoretical Computer Science 404(1-2), 52–60 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Csuhaj-Varjú, E., Vaszil, Gy.: Representation of language classes in terms of P automata (manuscript, 2009)Google Scholar
  18. 18.
    Csuhaj-Varjú, E., Vaszil, Gy.: Logic for P automata (manuscript, 2009)Google Scholar
  19. 19.
    Dassow, J., Vaszil, Gy.: P finite automata and regular languages over countably infinite alphabets. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 367–381. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  20. 20.
    Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, Gh.: On three classes of automata-like P systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 292–303. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  21. 21.
    Freund, R., Oswald, M.: A short note on analysing P systems. Bulletin of the EATCS 78, 231–236 (2002)zbMATHMathSciNetGoogle Scholar
  22. 22.
    Freund, R., Oswald, M.: P automata with activated/prohibited membrane channels. In: Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 261–269. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  23. 23.
    Freund, R., Oswald, M.: P automata with membrane channels. Artificial Life and Robotics 8, 186–189 (2004)CrossRefGoogle Scholar
  24. 24.
    Freund, R., Oswald, M.: P systems with conditional communication rules assigned to membranes. Journal of Automata, Languages and Combinatorics 9(4), 387–397 (2004)zbMATHMathSciNetGoogle Scholar
  25. 25.
    Freund, R., Oswald, M., Staiger, L.: ω-P automata with communication rules. In: Martín-Vide, C., Mauri, G., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)Google Scholar
  26. 26.
    Freund, R., Verlan, S.: (Tissue) P systems working in the k-restricted minimally parallel derivation mode. In: Csuhaj-Varjú, E., et al. (eds.) International Workshop on Computing with Biomolecules, Wien, Austria, August 27, 2008, pp. 43–52. Österreichische Computer Gesellschaft (2008)Google Scholar
  27. 27.
    Long, H., Fu, Y.: A general approach for building combinational P automata. International Journal of Computer Mathematics 84(12), 1715–1730 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Ibarra, O.H., Păun, Gh.: Characterization of context-sensitive languages and other language classes in terms of symport/antiport P systems. Theoretical Computer Science 358(1), 88–103 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134, 329–363 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Madhu, M., Krithivasan, K.: On a class of P automata. International Journal of Computer Mathematics 80(9), 1111–1120 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Martín-Vide, C., Păun, A., Păun, Gh.: On the power of P systems with symport rules. Journal of Universal Computer Science 8, 317–331 (2002)Google Scholar
  32. 32.
    Oswald, M.: P Automata. PhD dissertation, Vienna University of Technology (2003)Google Scholar
  33. 33.
    Oswald, M., Freund, R.: P Automata with membrane channels. In: Sugisaka, M., Tanaka, H. (eds.) Proc. of the Eights Int. Symp. on Artificial Life and Robotics, Beppu, Japan, pp. 275–278 (2003)Google Scholar
  34. 34.
    Otto, F.: Classes of regular and context-free languages over countably infinite alphabets. Discrete Applied Mathematics 12, 41–56 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  35. 35.
    Păun, A., Păun, Gh.: The power of communication: P systems with symport/antiport. New Generation Computing 20(3), 295–305 (2002)zbMATHCrossRefGoogle Scholar
  36. 36.
    Păun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  37. 37.
    Păun, Gh.: Membrane Computing. An Introduction. Springer, Berlin (2002)zbMATHGoogle Scholar
  38. 38.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)zbMATHGoogle Scholar
  39. 39.
    Sburlan, D.: Private communication (2009)Google Scholar
  40. 40.
    Vaszil, Gy.: A class of P automata characterizing context-free languages. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Proceedings of the Fourth Brainstorming Week on Membrane Computing, Sevilla, Spain, January 30-February 3, vol. II, RGNC Report, 03/2006, Fénix Editora, Sevilla, pp. 267–276 (2006)Google Scholar
  41. 41.
    Vaszil, Gy.: Automata-like membrane systems - A natural way to describe complex phenomena. In: Campeanu, C., Pighizzini, G. (eds.) Proceedings of 10th International Workshop on Descriptional Complexity of Formal Systems, Charlottetown, PE, Canada, July 16-18, pp. 26–37. University of Prince Edwards Island (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
    • 2
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  2. 2.Department of Algorithms and Their Applications, Faculty of InformaticsEötvös Loránd UniversityBudapestHungary

Personalised recommendations