Mostrar el registro sencillo del ítem

Ponencia

dc.creatorVaszil, György
dc.date.accessioned2016-03-04T09:29:27Z
dc.date.available2016-03-04T09:29:27Z
dc.date.issued2005
dc.identifier.isbn84-609-6771-9es
dc.identifier.urihttp://hdl.handle.net/11441/36867
dc.description.abstractWe 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.es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings 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,es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleOn a Class of P Automata as a Machine Model for Languages over Infinite Alphabetses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/36867

FicherosTamañoFormatoVerDescripción
bravol317.pdf163.2KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional