Skip to main content
SpringerLink
Log in

P transducers

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The “Sevilla carpet” of a computation is defined for P transducers, giving a representation of the control part for these P transducers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K. and Walter, P.,Molecular Biology of the Cell 4 ed., Garland Publishing, New York, 2002.

    Google Scholar 

  2. Bordihn, H., Fernau, H. and Holzer, M., “On Iterated Sequential Transducers,”Grammars and Automata for String Processing (Martín-Vide, C. and Mitrana, V. eds.), pp. 121–130, Taylor and Francis, London, 2003.

    Google Scholar 

  3. Ciobanu, G., Păun, Gh. and Ştefănescu, Gh., “Sevilla Carpets Associated with P Systems,”Proc. Brainstorming Week on Membrane Computing, Tarragona, Feb2003, Report 26/03, Rovira i Virgili University (Cavaliere, M., Martín-Vide, C. and Păun, Gh. eds.), pp. 135–140.

  4. Csuhaj-Varju, E. and Vaszil, C., “New Results and Research Directions Concerning P Automata,”Proc. Brainstorming Week on Membrane Computing, Tarragona, Report 26/03, Rovira i Virgili University (Cavaliere, M., Martín-Vide, C. and Păun, Gh., eds.), pp. 171–179, Feb. 2003.

  5. Csuhaj-Varju, E. and Vaszil, G., “P Automata or Purely Communicating Accepting P Systems,”Membrane Computing (Păun, Gh., Rozenberg, G., Salomaa, A. and Zandron, C. eds.),Lecture Notes in Computer Science, 2597, Springer, pp. 219–233, 2002.

  6. Freund, R. and Oswald, M. “A Short Note on Analysing P Systems,”Bulletin of the EATCS, 78, pp. 231–236. Oct. 2002.

    MathSciNet  Google Scholar 

  7. Freund, R. and Păun, A., “Membrane Systems with Symport/Antiport: Universality Results,”Membrane Computing (Păun, Gh., Rozenberg, G., Salomaa, A. and Zandron, C. eds.),Lecture Notes in Computer Science, 2597, pp. 270–287, 2002.

  8. Freund, R., Martín-Vide, C., Obtulowicz, A. and Păun, Gh., “Initial Automata-like P Systems,” submitted, 2003.

  9. Freund, R., Martín-Vide, C., Obtulowicz, A. and Păun, Gh., “On Three Classes of Automata-like P Systems,”Proc. DLT 2003, Szeged, Hungary, Lecture Notes in Computer Science, 2710, Springer, pp. 292–303, 2003.

  10. Frisco, P. and Hoogeboom, H. J., “Simulating Counter Automata by P systems with Symport/Antiport,”Membrane Computing (Păun, Gh., Rozenberg, G., Salomaa, A. and Zandron, C. eds.),Lecture Notes in Computer Science, 2597, Springer, pp. 288–301, 2002.

  11. Hopcroft, J. E. and Ullman, J. D.,Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.

    MATH  Google Scholar 

  12. Krithivasan, K. and Madhu, M., “On a Class of P Automata,”Intern. Journ. Computer Math, 80, 9, pp. 1111–1120, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  13. Manca, V., Martín-Vide, C. and Păun, Gh., “Iterated GSM Mappings: A Collapsing Hierarchy,”Jewels are Forever (Karhumaki, J., Maurer, H., Păun, Gh. and Rozenberg, G., eds.), Springer, Berlin, pp. 182–193, 1999.

    Google Scholar 

  14. Minsky, M. L.,Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, New Jersey, USA, 1967.

    MATH  Google Scholar 

  15. Păun, A. and Păun, Gh., “The Power of Communication: P Systems with Symport/Antiport,”New Generation Computing, 20, 3, pp. 295–306, 2002.

    Article  MATH  Google Scholar 

  16. Păun, Gh., “Computing with Membranes,”Journal of Computer and System Sciences, 61, 1, pp. 108–143, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  17. Păun, Gh.,Membrane Computing. An Introduction, Springer, Berlin, 2002.

    MATH  Google Scholar 

  18. Păun, Gh., “On the Iteration of Gsm Mappings,”Rev. Roum. Math. Pures Appl., 23, 4, pp. 921–937, 1978.

    MATH  Google Scholar 

  19. Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C., eds.,Membrane Computing, Lecture Notes in Computer Science, 2597, Springer, 2002.

  20. Salomaa, A.,Formal Languages, Academic Press, New York, 1973.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Romanian Academy, Bd. Copou 8, 700505, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, 014700 Bucharest, PO Box 1-764, Romania

    Gheorghe Păun

  3. Department of Computer Science and AI, Sevilla University Avda Reina Mercedes s/n, 41012, Sevilla, Spain

    Gheorghe Păun

  4. School of Computing, National University of Singapore, 10 Kent Ridge Crescent, 119260, Singapore, Singapore

    Gheorghe Ştefănescu

Authors
  1. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gheorghe Ştefănescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Gabriel Ciobanu, Ph.D.: He has graduated from the Faculty of Mathematics, “A.I.Cuza” University of Iasi, and received his Ph.D. from the same university. He is a senior researcher at the Institute of Computer Science of the Romanian Academy. He has wide-ranging interests in computing including distributed systems and concurrency, computational methods in biology, membrane computing, and theory of programming (semantics, formal methods, logics, verification). He has published around 90 papers in computer science and mathematics, a book on programming semantics and a book on network programming. He is a co-editor of three volumes. He has visited various universities in Europe, Asia, and North America, giving lectures and invited talks. His webpage is http://www.info.uaic.ro/gabriel

Gheorghe Păun, Ph.D.: He has graduated from the Faculty of Mathematics, University of Bucharest, in 1974 and received his Ph.D. from the same university in 1977. Curently he works as senior researcher in the Institute of Mathematics of the Romanian Academy, as well as a Ramon y Cajal researcher in Sevilla University, Spain. He has repeatedly visited numerous universities in Europe, Asia, and North America. His main research areas are formal language theory and its applications, computational linguistics, DNA computing, and membrane computing (a research area initiated by him). He has published over 400 research papers (collaborating with many researchers worldwide), has lectured at over 100 universities, and gave numerous invited talks at recognized international conferences. He has published 11 books in mathematics and computer science, has edited about 30 collective volumes, and also published many popular science books and books on recreational mathematics (games). He is on the editorial boards of fourteen international journals in mathematics, computer science, and linguistics, and was/is involved in the program/steering/organizing commitees for many recognized conferences and workshops. In 1997 he was elected a member of the Romanian Academy.

Gheorghe Ştefănescu, Ph.D.: He received his B.Sc./M.Sc./Ph.D. degrees in Computer Science from the University of Bucharest. Currently, he is a Professor of Computer Science at the University of Bucharest and a Senior Fellow at the National University of Singapore. Previously, he was a researcher at the Institute of Mathematics of the Romanian Academy and has held visiting positions in The Netherlands, Germany, and Japan. His current research focuses on formal methods in computer science, particularly on process and network algebras, formal methods for interactive, real-time, and object-oriented systems. Some of his results may be found in his book on “Network Algebra,” Springer, 2000.

About this article

Cite this article

Ciobanu, G., Păun, G. & Ştefănescu, G. P transducers. New Gener Comput 24, 1–28 (2006). https://doi.org/10.1007/BF03037291

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037291

Keywords

Search

Navigation