Deterministic one-counter automata. (English) Zbl 0307.68038


68Q45 Formal languages and automata
03D05 Automata and formal grammars in connection with logical questions
Full Text: DOI


[1] Hopcroft, J. E.; Ullman, J. D., (Formal Languages and Their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0196.01701
[2] Landau, E., (Handbuch der Lehre von der Verteilung der Primzahlen (1909), Teubner: Teubner Leipzig und Berlin), (Reprinted 1953, Chelsea) · JFM 40.0232.08
[3] Minsky, M. L., (Computation: Finite and Infinite Machines (1967), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ) · Zbl 0195.02402
[4] Paterson, M. S., Decision problems in computational models, (Proc. ACM Conference on Proving Assertions about Programs. Proc. ACM Conference on Proving Assertions about Programs, Las Cruces, New Mexico (1972)) · Zbl 0186.01103
[5] Rosenkrantz, D. J.; Stearns, R. E., Properties of deterministic top-down grammars, Information and Control, 17, 226-256 (1970) · Zbl 0209.02703
[6] Valiant, L. G., Decision procedures for families of deterministic pushdown automata, (Ph.D. Thesis., Report No. 7 (1973), University of Warwick Computer Centre) · Zbl 0566.94022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.