Periodic properties of pushdown automata
-
Ilya E. Ivanov
Abstract
Finite automata transform periodic sequences into periodic ones. The period of the output sequence is bounded from above by a linear function of input period. It is known that pushdown automata also preserve the set of periodic sequences. We prove that the output period for one-counter pushdown automata is bounded from above by a quadratic function of input period. We also give an example of an automaton with a quadratic lower bound on output period.
Originally published in Diskretnaya Matematika (2018) 30, №3, 40–47 (in Russian).
References
[1] Oettinger A., “Automatic syntactic analysis and the pushdown store”, Structure of Language and its Mathematical Concepts, Proc. 12th Symp. Appl. Math., 1961, 104–129.10.1090/psapm/012/9975Search in Google Scholar
[2] Schutzenberger M. P., “On context-free languages and pushdown automata”, Inf. and Control6:3 (1963), 246–264.10.1016/S0019-9958(63)90306-1Search in Google Scholar
[3] Chomsky N., “Context-free grammars and pushdown storage”, Quart. Progr. Rep. No. 65, Res. Lab. Electronics, M.I.T., Princeton, New Jersey 1962.Search in Google Scholar
[4] Evey R.J., “Applications of pushdown-store machines”, Proc. AFIPS Fall Joint Computer Conf., 24, 1963, 215–227.10.1145/1463822.1463848Search in Google Scholar
[5] Ginsburg S., Rose G.F., “Some recursively unsolvable problems in ALGOL-like languages”, J. ACM10 (1963), 175–195.10.1145/321150.321153Search in Google Scholar
[6] Senizergues G., “The equivalence problem for deterministic pushdown automata is decidable”, Proc. ICALP 97, Lect. Notes Comput. Sci., 1256, Springer, Berlin, 1997, 671–681.10.1007/3-540-63165-8_221Search in Google Scholar
[7] Kudryavtsev V.B., Aleshin S.V., Podkolzin A.S., Introduction to Automata Theory, M.: Nauka, 1985 (in Russian).Search in Google Scholar
[8] Babin D. N., “On completeness of the binary boundedly determined functions with respect to superposition”, Discrete Math. Appl.1:4, (1991), 423–431.10.1515/dma.1991.1.4.423Search in Google Scholar
[9] Letunovskii A. A., “Cycle indices of an automaton”, Discrete Math. Appl.23:5-6 (2013), 445–450.10.1515/dma-2013-0030Search in Google Scholar
[10] Coy W., “Automata in Labyrinths”, Int. Conf. Fundamental. Comput. Theor., Lect. Notes Comput. Sci., 56, 1977, 65–71.10.1007/3-540-08442-8_71Search in Google Scholar
© 2019 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Periodic properties of pushdown automata
- Burnside-type problems in discrete geometry
- On affine classification of permutations on the space GF(2)3
- Limit distributions of the maximal distance to the nearest neighbour
- Elementary transformations of systems of equations over quasigroups and generalized identities
- Asymptotics for the logarithm of the number of k-solution-free sets in Abelian groups
- On the distribution of multiple power series regularly varying at the boundary point
- A letter to the Editor
Articles in the same Issue
- Frontmatter
- Periodic properties of pushdown automata
- Burnside-type problems in discrete geometry
- On affine classification of permutations on the space GF(2)3
- Limit distributions of the maximal distance to the nearest neighbour
- Elementary transformations of systems of equations over quasigroups and generalized identities
- Asymptotics for the logarithm of the number of k-solution-free sets in Abelian groups
- On the distribution of multiple power series regularly varying at the boundary point
- A letter to the Editor
