The degrees of nondeterminism in pushdown automata

  • Il. R. Nasyrov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chan Tat-hung; Ibarra, O.H. On the finite valuedness problem for sequential machines. Theor. Comp. Sci., 23 (1983), no.1, 95–101.Google Scholar
  2. 2.
    Chandra, M.R. Kintala; Patric, C. Fisher. Computations with a restricted number of nondeterministic steps. Proc. 9th ACM symp. Theor. Comput. (1977), 178–195.Google Scholar
  3. 3.
    Hromkovic J. On the power of alternation in finite automamata. Lect. Notes Comp. Sci., 176 (1984), 322–329.Google Scholar
  4. 4.
    Inoue K., Takanami I., Taniguichi H. A note on alternating on-line Turing machines. Inform Process. Lett., 15 (1982), no.4, 164–168.Google Scholar
  5. 5.
    Vermeir D., Savitch W.J. On the amount of nondeterminism in pushdown autamata. Ann. Soc. Math. Pol., Ser.IV, 4 (1981), no.2, 401–418.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Il. R. Nasyrov
    • 1
  1. 1.Chair of theoretical cyberneticsKazan universityKazanUSSR

Personalised recommendations