An infinite hierarchy of languages defined by dP systems

Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation of these separate strings; the overall string is distributed to the dP auto...

Descripción completa

Detalles Bibliográficos
Autores: Paun, Gheorghe, Pérez Jiménez, Mario de Jesús
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2012
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/79704
Acceso en línea:https://hdl.handle.net/11441/79704
https://doi.org/10.1016/j.tcs.2011.12.053
Access Level:acceso abierto
Palabra clave:Membrane Computing
dP system
Infinite hierarchy
Simple matrix grammar
id ES_c9dbaceeb3d739c19b51c68b2014f1be
oai_identifier_str oai:idus.us.es:11441/79704
network_acronym_str ES
network_name_str España
repository_id_str
spelling An infinite hierarchy of languages defined by dP systemsPaun, GheorghePérez Jiménez, Mario de JesúsMembrane ComputingdP systemInfinite hierarchySimple matrix grammarHere, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation of these separate strings; the overall string is distributed to the dP automaton components in a balanced way, i.e., in equal parts up to one symbol, like in the communication complexity area. The question whether or not the number of components induces an infinite hierarchy of the recognized languages was formulated as an open problem in the literature.Wesolve here affirmatively this question (by connecting P automata with right linear simple matrix grammars), then we also briefly discuss the relation between the balanced and the non-balanced way of splitting the input string among components; settling this latter problem remains as a research topic. Some other open problems are also formulated.Junta de Andalucía P08-TIC-04200ElsevierCiencias de la Computación e Inteligencia ArtificialTIC193: Computación NaturalJunta de Andalucía2012info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/79704https://doi.org/10.1016/j.tcs.2011.12.053reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésTheoretical Computer Science, 431 (mayo 2012), 4-12.P08-TIC-04200https://www.sciencedirect.com/science/article/pii/S030439751101019X?via%3Dihubinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/797042026-06-17T12:51:07Z
dc.title.none.fl_str_mv An infinite hierarchy of languages defined by dP systems
title An infinite hierarchy of languages defined by dP systems
spellingShingle An infinite hierarchy of languages defined by dP systems
Paun, Gheorghe
Membrane Computing
dP system
Infinite hierarchy
Simple matrix grammar
title_short An infinite hierarchy of languages defined by dP systems
title_full An infinite hierarchy of languages defined by dP systems
title_fullStr An infinite hierarchy of languages defined by dP systems
title_full_unstemmed An infinite hierarchy of languages defined by dP systems
title_sort An infinite hierarchy of languages defined by dP systems
dc.creator.none.fl_str_mv Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
author Paun, Gheorghe
author_facet Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
author_role author
author2 Pérez Jiménez, Mario de Jesús
author2_role author
dc.contributor.none.fl_str_mv Ciencias de la Computación e Inteligencia Artificial
TIC193: Computación Natural
Junta de Andalucía
dc.subject.none.fl_str_mv Membrane Computing
dP system
Infinite hierarchy
Simple matrix grammar
topic Membrane Computing
dP system
Infinite hierarchy
Simple matrix grammar
description Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation of these separate strings; the overall string is distributed to the dP automaton components in a balanced way, i.e., in equal parts up to one symbol, like in the communication complexity area. The question whether or not the number of components induces an infinite hierarchy of the recognized languages was formulated as an open problem in the literature.Wesolve here affirmatively this question (by connecting P automata with right linear simple matrix grammars), then we also briefly discuss the relation between the balanced and the non-balanced way of splitting the input string among components; settling this latter problem remains as a research topic. Some other open problems are also formulated.
publishDate 2012
dc.date.none.fl_str_mv 2012
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/79704
https://doi.org/10.1016/j.tcs.2011.12.053
url https://hdl.handle.net/11441/79704
https://doi.org/10.1016/j.tcs.2011.12.053
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Theoretical Computer Science, 431 (mayo 2012), 4-12.
P08-TIC-04200
https://www.sciencedirect.com/science/article/pii/S030439751101019X?via%3Dihub
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419428130586624
score 15,300719

Similares en LA Referencia