Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Membrane Computing

WMC 2006: Membrane Computing pp 367–381Cite as

P Finite Automata and Regular Languages over Countably Infinite Alphabets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4361))

Abstract

We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural extension of the notion of finite automata and that of regular languages to infinite alphabets. To this aim, we also show that P finite automata are equivalent to a restricted variant of register machines, providing a more conventional automata theoretical characterization of the same infinite alphabet language class.

Research supported in part by the Hungarian Scientific Research Fund “OTKA” grant no. F037567 and by the Alexander von Humboldt Foundation of the Federal Republic of Germany.

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

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. Cheng, E.H.Y., Kaminski, M.: Context-free Languages over Infinite Alphabets. Acta Informatica 35, 245–267 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Kaminski, M., Francez, N.: Finite-Memory Automata. Theoretical Computer Science 134, 329–363 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Martín-Vide, C., Păun, A., Păun, G.: On the Power of P Systems with Symport Rules. Journal of Universal Computer Science 8(2), 317–331 (2002)

    MathSciNet  Google Scholar 

  5. Otto, F.: Classes of Regular and Context-free Languages over Countably Infinite Alphabets. Discrete Applied Mathematics 12, 41–56 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Păun, A., Păun, G.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20(3), 295–306 (2002)

    Article  MATH  Google Scholar 

  7. Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  8. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Berlin (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016, Magdeburg, Germany

    Jürgen Dassow

  2. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111, Budapest, Hungary

    György Vaszil

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Leiden Institute of Advanced Computer Science, Universiteit Leiden, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Hendrik Jan Hoogeboom

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

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J., Vaszil, G. (2006). P Finite Automata and Regular Languages over Countably Infinite Alphabets. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2006. Lecture Notes in Computer Science, vol 4361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963516_23

Download citation

  • DOI: https://doi.org/10.1007/11963516_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69088-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation