Preview
Unable to display preview. Download preview PDF.
Literature
J.M. AUTEBERT, Non principalité du Cylindre des Langes a Compteur, Math. Syst. Theory, vol. 11, (1977), p. 157–167.
B.S. BAKER and R.V. BOOK, Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., vol. 8, (1974), p. 315–332.
S. CRESPI-REGHIZZI and D. MANDRIOLI, Petri Nets and Szilard Languages, Information and Control, vol. 33, (1977), p. 177–192.
S.GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publ. Comp., (1975).
J.GOLDSTINE, Automata with Data Storage, Proc. 10th annual ACM Symp. on Theory of Computing, (1978)
S.A. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, vol. 16, (1969), p. 91–106.
S.A. GREIBACH, The Hardest Context-Free Language, SIAM J. of Comp., vol. 2, (1973), p. 304–310.
S.A. GREIBACH, Remarks on the Complexity of Nondeterministic Counter Languages, Theoretical Computer Science, vol. 1, (1976), p. 269–288.
S.A.GREIBACH, Remarks on Blind and Partially Blind One-Way Multicounter Machines, Theoretical Computer Science, to appear.
M.HACK, Petri Net Languages, Computation Structures Group Memo 124, Project MAC, MIT, (1975).
M.HÖPNER, Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Technical report, Univ. Hamburg, IFI-HH-B-12/74, (1974).
M. HÖPNER and M. OPP, About Three Equational Classes of Languages Built up by Shuffle Operations, Lecture Notes in Comp. Sc., Springer, vol. 45, (1976), p. 337–344.
O.H. IBARRA, Reversal-Bounded Multicounter Machines and Their Decision Problems, J. Assoc. Computing Machinery, vol. 25, (1978), p. 116–133.
M.JANTZEN, On the Hierarchy of Petri Net Languages, R.A.I.R.O. Informatique théorique, to appear.
M.JANTZEN, Eigenschaften von Petrinetzsprachen, Research report, Univ. Hamburg, (1978).
M. LATTEUX, Cônes Rationelles Commutativement Clos, R.A.I.R.O. Informatique théorique, vol. 11, (1977), p. 29–51.
J.L. PETERSON, Computation Sequence Sets, J. Comp. Syst. Sc., vol. 13, (1976), p. 1–24.
G.S.SACERDOTE and R.L.TENNEY, The Decidability of the Reachability Problem for Vector-Addition Systems, Proc. 9th annual ACM Symp. on Theory of Computing, (1977), p. 61–76.
P.H. STARKE, Free Petri Net Languages, Lecture Notes in Comp. Sc., Springer, vol. 64, (1978), p. 506–515.
R. VALK, Self-Modifying Nets, a Natural Extension of Petri Nets, Lecture Notes in Comp. Sc., Springer, vol. 62, (1978), p. 464–476.
C. WRATHALL, Rudimentary Predicates and Relative Computation, SIAM J. Computing, vol. 7, (1978), p. 194–209.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jantzen, M. (1979). On zerotesting-bounded multicounter machines. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive