Geodesic
Zerotesting bounded one-way multicounter machines
Kybernetika, Tome 23 (1987) no. 1, pp. 13-18 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68Q05, 68Q25 
@article{KYB_1987_23_1_a1,
     author = {\v{D}uri\v{s}, Pavol and Hromkovi\v{c}, Juraj},
     title = {Zerotesting bounded one-way multicounter machines},
     journal = {Kybernetika},
     pages = {13--18},
     year = {1987},
     volume = {23},
     number = {1},
     zbl = {0619.68048},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1987_23_1_a1/}
}
TY  - JOUR
AU  - Ďuriš, Pavol
AU  - Hromkovič, Juraj
TI  - Zerotesting bounded one-way multicounter machines
JO  - Kybernetika
PY  - 1987
SP  - 13
EP  - 18
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KYB_1987_23_1_a1/
LA  - en
ID  - KYB_1987_23_1_a1
ER  - 
%0 Journal Article
%A Ďuriš, Pavol
%A Hromkovič, Juraj
%T Zerotesting bounded one-way multicounter machines
%J Kybernetika
%D 1987
%P 13-18
%V 23
%N 1
%U http://geodesic.mathdoc.fr/item/KYB_1987_23_1_a1/
%G en
%F KYB_1987_23_1_a1
Ďuriš, Pavol; Hromkovič, Juraj. Zerotesting bounded one-way multicounter machines. Kybernetika, Tome 23 (1987) no. 1, pp. 13-18. http://geodesic.mathdoc.fr/item/KYB_1987_23_1_a1/

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

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

[3] P. Ďuriš, J. Hromkovič: One-way simple multihead finite automata are not closed under concatenation. Theoret. Comput. Sci. 27 (1983), 121-125. | 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 reoginized by one-way two-head deterministic finite state automata. In: Mathematical Foundation of Computer Science 1981 - Proc. 16th Symposium, Štrbské pleso, Czechoslovakia, August 31 - September 4, 1981 (J. Gruska, M. Chytil, eds.).(Lecture Notes in Computer Science 118.) Springer-Velag Berlin - Heidelberg - New York 1981, pp. 304-313. | MR

[8] J. Hromkovič: Hierarchy of reversal and zerotesting bounded multicounter machines. In: Mathematicl 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-Velag Berlin - Heidelberg - New York - Tokoy 1984, pp. 312-321. | MR

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

[10] J. Hromkovič: Hierarchy of reversal bounded one-way multicounter machines. Kybernetika 22 (1986), 2, 200-206. | MR

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

[12] M. Jantzen: On zerotesting-bounded multicounter machines. In: Proc. 4th GI Conference, 1979, Springer-Velag Berlin - Heidelberg - New York , pp. 158-169. | MR | Zbl