Article
P automata revisited
Author/s | Paun, Gheorghe
Pérez Jiménez, Mario de Jesús ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2012 |
Deposit Date | 2018-10-30 |
Published in |
|
Abstract | We continue here the investigation of P automata, in their non-extended case, a class of
devices which characterize non-universal family of languages. First, a recent conjecture is
confirmed: any recursively enumerable ... We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable language is obtained from a language recognized by a P automaton, to which an initial (arbitrarily large) string is added. Then, we discuss possibilities of extending P automata, following suggestions from string finite automata. For instance, automata with a memory (corresponding to push-down automata) are considered and their power is briefly investigated, as well as some closure properties of the family of languages recognized by P automata. In the context, a brief survey of results about P and dP automata (a distributed version of P automata) is provided, and several further research topics are formulated. |
Funding agencies | Junta de Andalucía |
Project ID. | P08-TIC-04200
![]() |
Citation | Paun, G. y Pérez Jiménez, M.d.J. (2012). P automata revisited. Theoretical Computer Science, 454 (octubre 2012), 222-230. |
Files | Size | Format | View | Description |
---|---|---|---|---|
1-s2.0-S0304397512000837-main.pdf | 310.7Kb | ![]() | View/ | |