Kooperativer Bibliotheksverbund

Berlin Brandenburg


Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

  • 1985  (1)
  • 1
    Language: English
    In: Theoretical Computer Science, 1985, Vol.39, pp.267-280
    Description: This paper is concerned with the computational power of two-way automata with more than one subrecursive storage medium. Two-way automata with a stack (a nonerasing stack or a pushdown store, respectively) and an arbitrary number of checking stacks are of special interest. They are able to accept exactly those sets which are elementary in the sense of Kalmár. If the number of checking stacks is fixed, then the computational power of the corresponding restricted classes of automata can also be characterized in terms of time and space complexity classes.
    Keywords: Computer Science ; Mathematics
    ISSN: 0304-3975
    E-ISSN: 1879-2294
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages