Algebraic caractérisations of NTIME(F) and NTIME(F,A)
RAIRO. Informatique théorique, Tome 18 (1984) no. 4, pp. 365-385. 
@article{ITA_1984__18_4_365_0,
     author = {Stenger, Hans-J\"urgen},
     title = {Algebraic caract\'erisations of {NTIME}$(F)$ and {NTIME}$(F, A)$},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {365--385},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {4},
     year = {1984},
     mrnumber = {775839},
     zbl = {0547.68080},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1984__18_4_365_0/}
}
TY  - JOUR
AU  - Stenger, Hans-Jürgen
TI  - Algebraic caractérisations of NTIME$(F)$ and NTIME$(F, A)$
JO  - RAIRO. Informatique théorique
PY  - 1984
SP  - 365
EP  - 385
VL  - 18
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1984__18_4_365_0/
LA  - en
ID  - ITA_1984__18_4_365_0
ER  - 
%0 Journal Article
%A Stenger, Hans-Jürgen
%T Algebraic caractérisations of NTIME$(F)$ and NTIME$(F, A)$
%J RAIRO. Informatique théorique
%D 1984
%P 365-385
%V 18
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1984__18_4_365_0/
%G en
%F ITA_1984__18_4_365_0
Stenger, Hans-Jürgen. Algebraic caractérisations of NTIME$(F)$ and NTIME$(F, A)$. RAIRO. Informatique théorique, Tome 18 (1984) no. 4, pp. 365-385. http://www.numdam.org/item/ITA_1984__18_4_365_0/

1. B. S. Baker and R. V. Book, Reversal-bounded Multipushdown Machines, J. of Computer and Systems Science, Vol. 8, 1974, pp. 315-332. | MR | Zbl

2. R. V. Book, Simple Representations of certain classes of Languages, J.A.C.M., Vol. 25, 1978, No. 1, pp. 23-31. | MR | Zbl

3. R. V. Book, On languages Accepted by Space-bounded Oracle-Machines, Acta Informatica, Vol. 12, 1979, pp. 177-185. | MR | Zbl

4. R. V. Book, Complexity Classes of Formal Languages, Springer Lect. Notes in Comp. Sci., Vol. 74, pp. 43-56, Springer, Berlin, New York, 1979. | MR | Zbl

5. R. V. Book and C. Wrathall, On languages specified by relative acceptance, Theoretical Computer Science, Vol. 7, 1978, pp. 185-195. | MR | Zbl

6. S. Ginsburg, Algebraic and automata-theoretic properties of formal languages, North-Holland, Amsterdam, 1975. | MR | Zbl

7. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Amsterdam, 1979. | MR | Zbl

8. W. J. Paul, Komplexitätstheorie, Teubner, Stuttgart, 1978. | MR

9. H. Schwichtenberg, Rekursionszahlen und die Grzegorczyk Hierarchie, Arch. math. Logik, Vol. 12, 1969, pp. 85-97. | MR | Zbl

10. C. Wrathall, Subrecursive Predicates and Automata, Ph. D. dissertation, Harvard University, 1975.