Variants of Distributed P Automata and the Efficient Parallelizability of Languages

  • György Vaszil
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7184)


We give an overview of P automata and distributed P automata and the parallelizability of their accepted languages by focusing on those features of these systems which influence the efficiency of the parallelization.


Input Mapping Turing Machine Linear Speedup Regular Language Computational Step 
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.
    Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the Computational Complexity of P Automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 76–89. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Csuhaj-Varjú, E., Oswald, M., Vaszil, G.: P automata. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, ch. 6, pp. 144–167. Oxford University Press (2010)Google Scholar
  3. 3.
    Csuhaj-Varjú, E., Vaszil, G.: P Automata or Purely Communicating Accepting P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Dassow, J., Vaszil, G.: 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
  5. 5.
    Freund, R., Kogler, M., Păun, G., Pérez-Jiménez, M.J.: On the power of P and dP automata. Annals of Bucharest University Mathematical-Informatics Series LVIII, pp. 5–22 (2009)Google Scholar
  6. 6.
    Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. International Journal of Computing, Communication and Control V(2), 238–250 (2010)CrossRefGoogle Scholar
  7. 7.
    Păun, G., Pérez-Jiménez, M.J.: P and dP Automata: A Survey. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Maurer Festschrift. LNCS, vol. 6570, pp. 102–115. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  8. 8.
    Păun, G., Pérez-Jiménez, M.J.: An infinite hierarchy of languages defined by dP systems. Theoretical Computer Science (to appear)Google Scholar
  9. 9.
    Pérez–Jiménez, M.J.: A Computational Complexity Theory in Membrane Computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 125–148. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Vaszil, G.: On the Parallelizability of Languages Accepted by P Automata. In: Kelemen, J., Kelemenová, A. (eds.) Pǎun Festschrift. LNCS, vol. 6610, pp. 170–178. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • György Vaszil
    • 1
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations