Geodesic
One-counter pushdown-storage automata as transducers of sequences
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2018), pp. 62-65
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We give lower and upper bounds of max period of output sequence for realtime one-counter transducers depending on the characteristics of the transducer and period of input sequence. 
@article{VMUMM_2018_4_a11,
     author = {I. E. Ivanov},
     title = {One-counter pushdown-storage automata as transducers of sequences},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {62--65},
     year = {2018},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2018_4_a11/}
}
TY  - JOUR
AU  - I. E. Ivanov
TI  - One-counter pushdown-storage automata as transducers of sequences
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2018
SP  - 62
EP  - 65
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2018_4_a11/
LA  - ru
ID  - VMUMM_2018_4_a11
ER  - 
%0 Journal Article
%A I. E. Ivanov
%T One-counter pushdown-storage automata as transducers of sequences
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2018
%P 62-65
%N 4
%U http://geodesic.mathdoc.fr/item/VMUMM_2018_4_a11/
%G ru
%F VMUMM_2018_4_a11
I. E. Ivanov. One-counter pushdown-storage automata as transducers of sequences. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2018), pp. 62-65. http://geodesic.mathdoc.fr/item/VMUMM_2018_4_a11/

[1] Chomsky N., Context-free grammars and pushdown storage, Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Mass., 1962

[2] Evey R. J., “Applications of pushdown-store machines”, Fall Joint Computer Conference (Las Vegas, 1963), Proc. AFIPS, 24, 215–227 | Zbl

[3] Ginsburg S., Rose G. F., “Some recursively unsolvable problems in ALGOL-like languages”, J. Assoc. Comput. Mach., 10 (1963), 175–195 | DOI | MR | Zbl

[4] Ginsburg S., Greibach S., “Deterministic context free languages”, Inform. and Contr., 9:6 (1966), 620–648 | DOI | MR | Zbl

[5] Babin D.N., “O polnote dvukhmestnykh o.d.-funktsii otnositelno superpozitsii”, Diskretn. matem., 1:4 (1989), 86–91

[6] Babin D. N., “Klass avtomatov s superpozitsiyami, ne rasshiryayuschiisya do predpolnogo”, Intellekt. sistemy, 20:4 (2016), 155–166

[7] Letunovskii A.A., “Tsiklovye indeksy avtomata”, Diskretn. matem., 25:4 (2013), 24–29 | DOI | MR | Zbl

[8] Coy W., “Automata in labyrinths”, FCT, 1977, 65–71 | MR | Zbl

[9] Ivanov I.E., “Otsenka dliny perioda vykhodnoi posledovatelnosti dlya avtonomnogo avtomata s magazinnoi pamyatyu s odnobukvennym magazinom”, Intellekt. sistemy, 21:1 (2017), 106–140

[10] Kudryavtsev V.B., Aleshin S.V., Podkolzin A.S., Vvedenie v teoriyu avtomatov, Nauka, M., 1985 | MR