CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Computational power of one-way turing machines with sublogarithmic memory restrictions
Authors
Leshchev A.
Publication date
29 February 2020
Publisher
Abstract
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy. © 2014 Allerton Press, Inc
Similar works
Full text
Available Versions
National Open Repository Aggregator (NORA)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:rour.neicon.ru:rour/177720
Last time updated on 04/04/2020
National Open Repository Aggregator (NORA)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:rour.neicon.ru:rour/133281
Last time updated on 04/04/2020