Zerotesting bounded one-way multicounter machines
Kybernetika (1987)
- Volume: 23, Issue: 1, page 13-18
- ISSN: 0023-5954
Access Full Article
top
How to cite
topĎuriš, Pavol, and Hromkovič, Juraj. "Zerotesting bounded one-way multicounter machines." Kybernetika 23.1 (1987): 13-18. <http://eudml.org/doc/27930>.
@article{Ďuriš1987,
author = {Ďuriš, Pavol, Hromkovič, Juraj},
journal = {Kybernetika},
keywords = {One-way multicounter machines; counter reversals; zero-tests; nondeterminism; time},
language = {eng},
number = {1},
pages = {13-18},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Zerotesting bounded one-way multicounter machines},
url = {http://eudml.org/doc/27930},
volume = {23},
year = {1987},
}
TY - JOUR
AU - Ďuriš, Pavol
AU - Hromkovič, Juraj
TI - Zerotesting bounded one-way multicounter machines
JO - Kybernetika
PY - 1987
PB - Institute of Information Theory and Automation AS CR
VL - 23
IS - 1
SP - 13
EP - 18
LA - eng
KW - One-way multicounter machines; counter reversals; zero-tests; nondeterminism; time
UR - http://eudml.org/doc/27930
ER -
References
top- T. Chan, Reversal complexity of counter machines, In: Proc. IEEE Symposium on Theory of Computiong 1981, IEEE New York, pp. 146-157. (1981)
- 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. (1982) MR0719444
- P. Ďuriš, J. Hromkovič, One-way simple multihead finite automata are not closed under concatenation, Theoret. Comput. Sci. 27 (1983), 121-125. (1983) MR0742281
- S. Ginsburg, Algebraic and Automata - Theoretic Properties of Formal Languages, North-Holland Publ. Comp., Amsterdam 1975. (1975) Zbl0325.68002MR0443446
- S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theoret. Comput. Sci 7 (1978), 311-324. (1978) Zbl0389.68030MR0513714
- M. Hack, Petri Net Languages, Computation Structures, Group Memo 124, Project MAC, MIT, 1975. (1975)
- 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. (1981) MR0652763
- 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. (1984) MR0783460
- J. Hromkovič, Reversal bounded multicounter machines, Computers and Artificial Intelligence 4 (1985), 4, 361-366. (1985)
- J. Hromkovič, Hierarchy of reversal bounded one-way multicounter machines, Kybernetika 22 (1986), 2, 200-206. (1986) MR0849689
- O. H. Ibarra, REcersal bounded multicounter machines and their decision problems, J. Assoc. Comput. Mach. 25 (1978), 116-133. (1978) MR0461988
- M. Jantzen, On zerotesting-bounded multicounter machines, In: Proc. 4th GI Conference, 1979, Springer-Velag Berlin - Heidelberg - New York , pp. 158-169. (1979) Zbl0411.68070MR0568101
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.