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

Matrix Languages, Register Machines, Vector Addition Systems

Opened Access Matrix Languages, Register Machines, Vector Addition Systems
Estadísticas
Icon
Exportar a
Autor: Freund, Rudolf
Ibarra, Óscar H.
Paun, Gheorghe
Yen, Hsu-Chen
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2005
Publicado en: Proceedings of the Third Brainstorming Week on Membrane Computing, 155-167. Sevilla, E.T.S. de Ingeniería Informática, 31 de Enero-4 de Febrero, 2005,
ISBN/ISSN: 84-609-6771-9
Tipo de documento: Ponencia
Resumen: We give a direct and simple proof of the equality of Parikh images of lan- guages generated by matrix grammars with appearance checking with the sets of vectors generated by register machines. As a particular case, we get the equality of the Parikh images of languages generated by matrix grammars without appearance checking with the sets of vectors generated by partially blind register machines. Then, we consider pure matrix grammars (i.e., grammars which do not distinguish terminal and nonterminal symbols), and prove the inclusion of the family of Parikh images of languages generated by such grammars (without appearance checking) in the family of sets of vectors generated by blind register machines, as well as the inclusion of reachability sets of vector addition systems in the family of Parikh images of pure matrix languages. For pure matrix grammars with a certain restriction on the form of matrices, also the converse of the latter inclusion is obtained. Thus, in view of t...
[Ver más]
Tamaño: 180.4Kb
Formato: PDF

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

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones