Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
21
views
14
references
 Top references
cited by
3
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      5,908
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Computer Science – Theory and Applications 

      Two-Way Automata versus Logarithmic Space

      other
      Author(s):
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Article: not found

          Relationships between nondeterministic and deterministic tape complexities

          Walter J. Savitch (1970)
          Article 0 comments Cited 116 times – based on 0 reviews     Review now
          Article has an altmetric score of 11
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Random walks, universal traversal sequences, and the complexity of maze problems

            Romas Aleliunas, Richard M Karp, Richard Lipton … (1979)
            Article 0 comments Cited 81 times – based on 0 reviews
            Article has an altmetric score of 12
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Classes of languages and linear-bounded automata

              S.-Y. Kuroda (1964)
              Article 0 comments Cited 32 times – based on 0 reviews     Review now
              Article has an altmetric score of 6
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2011
                Pages: 359-372
                DOI: 10.1007/978-3-642-20712-9_28
                SO-VID: 2cb013fd-158b-4b78-9c9d-afc462e321eb
                License:

                http://www.springer.com/tdm

                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content5,908

                See all similar

                Cited by3

                See all cited by