Geodesic
Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata
Communications in Mathematics, Tome 01 (1993) no. 1, pp. 67-73

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Classification : 68Q45, 68Q70 
@article{COMIM_1993__1_1_a7,
     author = {Jan\v{c}ar, Petr},
     title = {Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata},
     journal = {Communications in Mathematics},
     pages = {67--73},
     publisher = {mathdoc},
     volume = {01},
     number = {1},
     year = {1993},
     mrnumber = {1250928},
     zbl = {0853.68118},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/}
}
TY  - JOUR
AU  - Jančar, Petr
TI  - Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata
JO  - Communications in Mathematics
PY  - 1993
SP  - 67
EP  - 73
VL  - 01
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/
LA  - en
ID  - COMIM_1993__1_1_a7
ER  - 
%0 Journal Article
%A Jančar, Petr
%T Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata
%J Communications in Mathematics
%D 1993
%P 67-73
%V 01
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/
%G en
%F COMIM_1993__1_1_a7
Jančar, Petr. Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Communications in Mathematics, Tome 01 (1993) no. 1, pp. 67-73. http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/