Browsing Artículos (Ciencias de la Computación e Inteligencia Artificial) by Subject "Closure properties"
Now showing items 1-1 of 1
P automata revisited [Article](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 ...