Geodesic
Hierarchy of reversal bounded one-way multicounter machines
Kybernetika, Tome 22 (1986) no. 2, pp. 200-206 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68Q05, 68Q15, 68Q25 
@article{KYB_1986_22_2_a7,
     author = {Hromkovi\v{c}, Juraj},
     title = {Hierarchy of reversal bounded one-way multicounter machines},
     journal = {Kybernetika},
     pages = {200--206},
     year = {1986},
     volume = {22},
     number = {2},
     mrnumber = {849689},
     zbl = {0607.68034},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1986_22_2_a7/}
}
TY  - JOUR
AU  - Hromkovič, Juraj
TI  - Hierarchy of reversal bounded one-way multicounter machines
JO  - Kybernetika
PY  - 1986
SP  - 200
EP  - 206
VL  - 22
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/KYB_1986_22_2_a7/
LA  - en
ID  - KYB_1986_22_2_a7
ER  - 
%0 Journal Article
%A Hromkovič, Juraj
%T Hierarchy of reversal bounded one-way multicounter machines
%J Kybernetika
%D 1986
%P 200-206
%V 22
%N 2
%U http://geodesic.mathdoc.fr/item/KYB_1986_22_2_a7/
%G en
%F KYB_1986_22_2_a7
Hromkovič, Juraj. Hierarchy of reversal bounded one-way multicounter machines. Kybernetika, Tome 22 (1986) no. 2, pp. 200-206. http://geodesic.mathdoc.fr/item/KYB_1986_22_2_a7/

[1] T. Chan: Reversal complexity of counter machines. In: Proc. IEEE Symposium on Theory of Computing 1981, IEEE, New York, 146-157.

[2] P. Ďuriš, J. Hromkovič: One-way simple multihead finite automata are not closed under concatenation. Theoret. Comput. Sci. 27 (1983), 121 - 225. | MR

[3] P. Ďuriš, Z. Galil: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Inform, artd Control 54 (1982), 3, 217-227. | MR

[4] S. Ginsburg: Algebraic and Automata - Theoretic Properties of Formal Languages. North-Holland Publ. Comp., Amsterdam 1975. | MR | Zbl

[5] S. A. Greibach: Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7 (1978), 311-324. | MR | Zbl

[6] M. Hack: Petri Net Languages, Computation Structures. Group Memo 124, Project MAC, MIT, 1975.

[7] J. Hromkovič: Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata. In: Mathematical Foundations of Computer Science 1981 - Proc. 10th Symposium, Štrbské pleso, Czechoslovakia, August 31 - September 4, 1981 (J. Gruska, M. Chytil, eds.). (Lecture Notes in Computer Science 118.) Springer-Verlag, Berlin-Heidelberg-New York 1981, 304-313. | MR

[8] J. Hromkovič: Hierarchy of reversal and zerotesting bounded multicounter machines. In: Mathematical Foundations of Computer Science 1984 - Proc. 11th Symposium, Prague, Czechoslovakia, September 3 - 7, 1984 (M. P. Chytil, V. Koubek, eds.). (Lecture Notes in Computer Science 176.) Springer-Verlag, Berlin-Heidelberg-New York-Tokyo 1984, 312-321. | MR

[9] J. Hromkovič: Reversal bounded multicounter machines. Computers and Artificial Intelligence 4 (1985), 4, 361-366.

[10] O. H. Ibarra: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25 (1978), 116-133. | MR | Zbl