Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (750kB) | Vista Previa |
Uniform Distributed Pushdown Automata Systems.
Cita
Arroyo Montoro, Fernando 
ORCID: https://orcid.org/0000-0002-2364-7312, Castellanos Peñuela, Juan Bautista ORCID: https://orcid.org/0000-0002-9223-3754 and Mitrana, Víctor ORCID: https://orcid.org/0000-0002-1457-8933
(2012).
Uniform Distributed Pushdown Automata Systems..
En: "14th International Workshop, DCFS 2012 Descriptional Complexity of Formal Systems.", 23/07/2012 - 25/07/2012, Braga, Portugal. ISBN 0302-9743. pp. 64-75.
https://doi.org/10.1007/978-3-642-31623-4_5.
ORCID: https://orcid.org/0000-0002-2364-7312, Castellanos Peñuela, Juan Bautista ORCID: https://orcid.org/0000-0002-9223-3754 and Mitrana, Víctor ORCID: https://orcid.org/0000-0002-1457-8933
(2012).
Uniform Distributed Pushdown Automata Systems..
En: "14th International Workshop, DCFS 2012 Descriptional Complexity of Formal Systems.", 23/07/2012 - 25/07/2012, Braga, Portugal. ISBN 0302-9743. pp. 64-75.
https://doi.org/10.1007/978-3-642-31623-4_5.
Descripción
| Título: | Uniform Distributed Pushdown Automata Systems. |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | 14th International Workshop, DCFS 2012 Descriptional Complexity of Formal Systems. |
| Fechas del Evento: | 23/07/2012 - 25/07/2012 |
| Lugar del Evento: | Braga, Portugal |
| Título del Libro: | DCFS 2012 Proceedings en Lecture Notes in Computer Science |
| Fecha: | 2012 |
| ISBN: | 0302-9743 |
| Volumen: | 7386 |
| Materias: | |
| ODS: | |
| Escuela: | E.U. de Informática (UPM) [antigua denominación] |
| Departamento: | Lenguajes, Proyectos y Sistemas Informáticos |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
We consider here uniform distributed pushdown automata systems (UDPAS), namely distributed pushdown automata systems having all components identical pushdown automata. We consider here just a single protocol for activating/deactivating components, namely a component stays active as long as it can perform moves, as well as two ways of accepting the input word: by empty stacks (all components have empty stacks) or by final states (all components are in final states), when the input word is completely read. We mainly investigate the computational power of UDPAS accepting by empty stacks and a few decidability and closure properties of the families of languages they define. Some directions for further work and open problems are also discussed.
Más información
| ID de Registro: | 19733 |
|---|---|
| Identificador DC: | https://oa.upm.es/19733/ |
| Identificador OAI: | oai:oa.upm.es:19733 |
| Identificador DOI: | 10.1007/978-3-642-31623-4_5 |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 10 Mar 2014 13:50 |
| Ultima Modificación: | 21 Abr 2016 21:02 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
