One-Counter Pushdown-Storage Automata as Transducers of Sequences

N. Chomsky, Context-Free Grammars and Pushdown Storage (Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Mass, 1962).

R. J. Evey, “Applications of Pushdown-Store Machines,” in Proc. AFIPS Fall Joint Computer Conf. Vol. 24 (Las Vegas, 1963), pp. 215–227.

S. Ginsburg and G. F. Rose, “Some Recursively Unsolvable Problems in ALGOL-like Languages,” J. Assoc. Comput. Mach. 10, 175 (1963).

S. Ginsburg and S. Greibach, “Deterministic Context Free Languages,” Inform. and Contr. 9 (6), 620 (1966).

D. N. Babin, “On Completeness of the Binary Boundedly Determined Functions with Respect to Superposition,” Diskret. Matem. 1 (4), 86 (1989) [Discrete Math. Appl. 1 (4), 423 (1991)].

D. N. Babin, “A Class of Automata with Superpositions not Extendable up to a Precomplete One,” Intellekt. Sistemy 20 (4), 155 (2016).

A. A. Letunovskii, “Cycle Indices of an Automaton,” Diskret. Matem. 25 (4), 24 (2013) [Discrete Math. Appl. 25 (5–6), 445 (2013)].

W. Coy, “Automata in Labyrinths,” FCT, 1977, pp. 65–71.

I. E. Ivanov, “Estimate of the Period of Output Sequence for an Autonomous Automaton With Pushdown Storage and One-Counter Stack,” Intellekt. Sistemy 21 (1), 106 (2017).

V. B. Kudryavtsev, S. V. Aleshin, and A. S. Podkolzin, Introduction to the Automata Theory (Nauka, Moscow, 1985).