Abstract
We present a new version of the inductive counting, accepting the complement of an NSPACE(s(n)) language nondeterministically in space O(s(n)) , independent of whether s(n)⩾ log n , but using an additional “one-way pebble” – a movable marker placed on the input tape. This reduces the space used by inductive counting to log n+ O(s(n)) bits on the binary work tape and gives the weakest known nondeterministic device accepting a co− NSPACE( o( log n)) language.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
