Repositorio de producción científica de la Universidad de Sevilla

On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets

 

Advanced Search
 
Opened Access On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
Cites
Show item statistics
Icon
Export to
Author: Vaszil, György
Date: 2005
Published in: Proceedings of the Third Brainstorming Week on Membrane Computing, 317-325. Sevilla, E.T.S. de Ingeniería Informática, 31 de Enero-4 de Febrero, 2005,
ISBN/ISSN: 84-609-6771-9
Document type: Presentation
Abstract: 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.
Size: 163.2Kb
Format: PDF

URI: http://hdl.handle.net/11441/36867

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)