Computational power of one-way turing machines with sublogarithmic memory restrictions

dc.contributor.author	Leshchev A.
dc.date.accessioned	2018-09-18T20:17:17Z
dc.date.available	2018-09-18T20:17:17Z
dc.date.issued	2014
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/138328
dc.description.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.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	memory restrictions
dc.subject	nondeterministic Turing machine
dc.subject	one-way Turing machine
dc.title	Computational power of one-way turing machines with sublogarithmic memory restrictions
dc.type	Article
dc.relation.ispartofseries-issue	9
dc.relation.ispartofseries-volume	58
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	66
dc.source.id	SCOPUS1066369X-2014-58-9-SID84906212805

Файлы в этом документе

Размер: 43.65Kb

Формат: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.