Buscar
Mostrando ítems 1-1 de 1
Artículo
P automata revisited
(Elsevier, 2012)
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 ...