Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Nondeterministic computations in sublogarithmic space and space constructibility

Published: 01 April 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Index Terms

  1. Nondeterministic computations in sublogarithmic space and space constructibility

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image SIAM Journal on Computing
      SIAM Journal on Computing  Volume 20, Issue 3
      June 1991
      198 pages
      ISSN:0097-5397
      Issue’s Table of Contents

      Publisher

      Society for Industrial and Applied Mathematics

      United States

      Publication History

      Published: 01 April 1991

      Author Tags

      1. nondeterministic space
      2. nondeterministic turing machine
      3. space constructibility
      4. space-bounded computation

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 21 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2019)Space hierarchy theorem revisedTheoretical Computer Science10.5555/2780705.2781193295:1(171-187)Online publication date: 6-Jan-2019
      • (2019)Converting two-way nondeterministic unary automata into simpler automataTheoretical Computer Science10.5555/2780705.2781182295:1(189-203)Online publication date: 6-Jan-2019
      • (2019)One Pebble Versus ϵ · log n BitsFundamenta Informaticae10.5555/1922662.1922666104:1-2(55-69)Online publication date: 4-Jan-2019
      • (2019)Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)Theory of Computing Systems10.1007/s00224-018-9844-763:4(688-714)Online publication date: 1-May-2019
      • (2018)Four-dimensional multi-inkdot finite automataWSEAS Transactions on Computers10.5555/1481923.14819297:9(1437-1446)Online publication date: 17-Dec-2018
      • (2018)On the History of Computer Science, Computer Engineering, and Computer Technology Development in SlovakiaIEEE Annals of the History of Computing10.1109/85.77898121:3(38-48)Online publication date: 27-Dec-2018
      • (2008)On the State Complexity of Operations on Two-Way Finite AutomataProceedings of the 12th international conference on Developments in Language Theory10.1007/978-3-540-85780-8_35(443-454)Online publication date: 16-Sep-2008
      • (2007)Magic numbers in the state hierarchy of finite automataInformation and Computation10.1016/j.ic.2007.07.001205:11(1652-1670)Online publication date: 1-Nov-2007
      • (2006)A note on non-closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) statesJournal of Computer Science and Technology10.1007/s11390-006-0979-721:6(979-983)Online publication date: 1-Nov-2006

      View Options

      View options

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media