P finite automata and regular languages over countably infinite alphabets

Authors:
Jürgen Dassow;György Vaszil
Affiliations:
Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Year:
2006

Citing 5
Cited 6

Finite-memory automata

Theoretical Computer Science
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
P Automata or Purely Communicating Accepting P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing

(Mem)brane automata

Theoretical Computer Science
P and dP automata: a survey

Rainbow of computer science
P automata: concepts, results, and new aspects

WMC'09 Proceedings of the 10th international conference on Membrane Computing
Variants of distributed p automata and the efficient parallelizability of languages

CMC'11 Proceedings of the 12th international conference on Membrane Computing
P and dp automata: unconventional versus classical automata

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
P automata revisited

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.