Skip to main content
SpringerLink
Log in

One-Counter Pushdown-Storage Automata as Transducers of Sequences

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

We present lower and upper bounds of the maximal period of output sequence for realtime one-counter transducers depending on the characteristics of the transducer and the period of input sequence.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)].

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  9. 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).

    Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    I. E. Ivanov

Authors
  1. I. E. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. E. Ivanov.

Additional information

Original Russian Text © I.E. Ivanov, 2018, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2018, Vol. 73, No. 4, pp. 62–65.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ivanov, I.E. One-Counter Pushdown-Storage Automata as Transducers of Sequences. Moscow Univ. Math. Bull. 73, 164–167 (2018). https://doi.org/10.3103/S0027132218040083

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132218040083

Search

Navigation