Careful synchronization of partial deterministic finite automata

Shabana, H.; Volkov, M. V.

doi:10.1007/s00236-022-00433-1

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/118011

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Shabana, H.	en
dc.contributor.author	Volkov, M. V.	en
dc.date.accessioned	2022-10-19T05:21:06Z	-
dc.date.available	2022-10-19T05:21:06Z	-
dc.date.issued	2022	-
dc.identifier.citation	Shabana H. Careful synchronization of partial deterministic finite automata / H. Shabana, M. V. Volkov // Acta Informatica. — 2022. — Vol. 59. — Iss. 4. — P. 479-504.	en
dc.identifier.issn	15903	-
dc.identifier.other	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85134678836&doi=10.1007%2fs00236-022-00433-1&partnerID=40&md5=f30a64643531677b452ce8c1f2d21c52	link
dc.identifier.uri	http://elar.urfu.ru/handle/10995/118011	-
dc.description.abstract	We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experiments demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used. We compare our results with the ones obtained by the first author for exact synchronization, which is another version of synchronization studied in the literature, and draw some theoretical conclusions. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.	en
dc.description.sponsorship	Ministry of Education and Science of the Russian Federation, Minobrnauka: FEUZ-2020-0016	en
dc.description.sponsorship	Supported by the Ministry of Science and Higher Education of the Russian Federation, project FEUZ-2020-0016.	en
dc.format.mimetype	application/pdf	en
dc.language.iso	en	en
dc.publisher	Springer Science and Business Media Deutschland GmbH	en
dc.rights	info:eu-repo/semantics/openAccess	en
dc.source	Acta Informatica	en
dc.subject	COMPUTATIONAL RESOURCES	en
dc.subject	DETERMINISTIC AUTOMATON	en
dc.subject	DETERMINISTIC FINITE AUTOMATA	en
dc.subject	ENCODINGS	en
dc.subject	SYNCHRONIZING WORDS	en
dc.subject	SYNCHRONIZATION	en
dc.title	Careful synchronization of partial deterministic finite automata	en
dc.type	Article	en
dc.type	info:eu-repo/semantics/article	en
dc.type	info:eu-repo/semantics/publishedVersion	en
dc.identifier.doi	10.1007/s00236-022-00433-1	-
dc.identifier.scopus	85134678836	-
local.contributor.employee	Shabana, H., Faculty of Electronic Engineering, Menoufia University, Menouf, Egypt, Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation	en
local.contributor.employee	Volkov, M.V., Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation	en
local.description.firstpage	479	-
local.description.lastpage	504	-
local.issue	4	-
local.volume	59	-
dc.identifier.wos	000828947600001	-
local.contributor.department	Faculty of Electronic Engineering, Menoufia University, Menouf, Egypt	en
local.contributor.department	Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation	en
local.identifier.pure	30897289	-
local.identifier.eid	2-s2.0-85134678836	-
local.identifier.wos	WOS:000828947600001	-
local.fund.feuz	FEUZ-2020-0016	-
Располагается в коллекциях:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:

Файл	Описание	Размер	Формат
2-s2.0-85134678836.pdf		284,21 kB	Adobe PDF	Просмотреть/Открыть

Показать базовое описание ресурса Статистика Google Scholar

Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.