Automatic structures and the theory of lists

dc.contributor.author	Bazhenov N.
dc.date.accessioned	2018-09-18T20:36:35Z
dc.date.available	2018-09-18T20:36:35Z
dc.date.issued	2015
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141651
dc.description.abstract	© 2015 Bazhenov N.A. Goncharov constructed the axiomatic theory of linear lists over the elements of a given data type. We study algorithmic complexity for models of this theory. We prove that the enriched list structure over a finite set of atoms is automatically presentable, and the enriched list structure over an infinite set of atoms has no automatic presentations.
dc.subject	Automatic structure
dc.subject	Decidable model
dc.subject	Linear list
dc.subject	List superstructure
dc.subject	Theory of lists
dc.title	Automatic structures and the theory of lists
dc.type	Article
dc.relation.ispartofseries-volume	12
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	714
dc.source.id	SCOPUS-2015-12-SID84953220741

Files in this item

Size: 43.50Kb

Format: PDF

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