Ponencia
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
Autor/es | Vaszil, György |
Fecha de publicación | 2005 |
Fecha de depósito | 2016-03-04 |
Publicado en |
|
ISBN/ISSN | 84-609-6771-9 |
Resumen | We show how P automata having a finite description and working with a
finite object-alphabet can be used to describe languages over countably infinite alphabets.
We propose to relate the language classes characterized ... We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations of language classes over infinite alphabets, and give an upper bound for the class of languages accepted by the class of one of the most straightforward and least complicated variants of these types of P automata. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
bravol317.pdf | 163.2Kb | [PDF] | Ver/ | |