22
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Two-Way Automata Versus Logarithmic Space

      Theory of Computing Systems
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references12

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

          Relationships between nondeterministic and deterministic tape complexities

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

            The Reduction of Two-Way Automata to One-Way Automata

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

              Classes of languages and linear-bounded automata

                Bookmark

                Author and article information

                Journal
                Theory of Computing Systems
                Theory Comput Syst
                Springer Nature
                1432-4350
                1433-0490
                August 2014
                April 11 2013
                August 2014
                : 55
                : 2
                : 421-447
                Article
                10.1007/s00224-013-9465-0
                a614e6af-a363-4a32-a2f0-4e32ec633909
                © 2014
                History

                Comments

                Comment on this article