Automata transformations of prefix decidable and decidable by Buchi superwords

dc.contributor.author	Korneeva N.
dc.date.accessioned	2018-09-19T20:55:00Z
dc.date.available	2018-09-19T20:55:00Z
dc.date.issued	2016
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/143421
dc.description.abstract	© 2016, Allerton Press, Inc.We show that the set of prefix decidable superwords is closed under finite automata and asynchronous automata transformations. We prove that structures of degrees of finite automata and asynchronous automata transformations contain an atom which consists of prefix decidable superwords with undecidable monadic theory (or undecidable by Buchi). Also we prove that the structure of degrees of asynchronous automata transformations contains an atom which consists of superwords with decidable monadic theory (decidable by Buchi).
dc.relation.ispartofseries	Russian Mathematics
dc.subject	atom
dc.subject	automata transformation
dc.subject	decidability by Buchi
dc.subject	degrees
dc.subject	monadic theory
dc.subject	monadic theory
dc.subject	prefix decidability
dc.subject	superword
dc.title	Automata transformations of prefix decidable and decidable by Buchi superwords
dc.type	Article
dc.relation.ispartofseries-issue	7
dc.relation.ispartofseries-volume	60
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	47
dc.source.id	SCOPUS1066369X-2016-60-7-SID84975862651

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

Размер: 43.67Kb

Формат: PDF

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