Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/101649
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Shabana, H. | en |
dc.contributor.author | Volkov, M. V. | en |
dc.date.accessioned | 2021-08-31T14:58:38Z | - |
dc.date.available | 2021-08-31T14:58:38Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Shabana H. Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata / H. Shabana, M. V. Volkov. — DOI 10.1007/978-3-030-33394-2_9 // Communications in Computer and Information Science. — 2019. — Vol. 1090 CCIS. — P. 103-118. | en |
dc.identifier.isbn | 9783030333935 | - |
dc.identifier.issn | 18650929 | - |
dc.identifier.other | Final | 2 |
dc.identifier.other | All Open Access, Green | 3 |
dc.identifier.other | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076254945&doi=10.1007%2f978-3-030-33394-2_9&partnerID=40&md5=c600d442c7506da40e48c8d624fc1d1f | |
dc.identifier.other | http://arxiv.org/pdf/1903.10549 | m |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/101649 | - |
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 experimental results demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used. © 2019, Springer Nature Switzerland AG. | 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 | Communications in Computer and Information Science | en |
dc.subject | CAREFUL SYNCHRONIZATION | en |
dc.subject | CAREFULLY SYNCHRONIZING WORD | en |
dc.subject | DETERMINISTIC AUTOMATON | en |
dc.subject | NONDETERMINISTIC AUTOMATON | en |
dc.subject | PARTIAL DETERMINISTIC AUTOMATON | en |
dc.subject | SAT | en |
dc.subject | SAT SOLVER | en |
dc.subject | AUTOMATA THEORY | en |
dc.subject | DECISION THEORY | en |
dc.subject | MODEL CHECKING | en |
dc.subject | OPERATIONS RESEARCH | en |
dc.subject | OPTIMIZATION | en |
dc.subject | SYNCHRONIZATION | en |
dc.subject | COMPUTATIONAL RESOURCES | en |
dc.subject | DETERMINISTIC AUTOMATA | en |
dc.subject | NONDETERMINISTIC AUTOMATA | en |
dc.subject | SAT SOLVERS | en |
dc.subject | SYNCHRONIZING WORDS | en |
dc.subject | ROBOTS | en |
dc.title | Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata | en |
dc.type | Conference Paper | en |
dc.type | info:eu-repo/semantics/conferenceObject | en |
dc.type | info:eu-repo/semantics/publishedVersion | en |
dc.identifier.doi | 10.1007/978-3-030-33394-2_9 | - |
dc.identifier.scopus | 85076254945 | - |
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 | |
local.contributor.employee | Volkov, M.V., Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation | |
local.description.firstpage | 103 | - |
local.description.lastpage | 118 | - |
local.volume | 1090 CCIS | - |
local.contributor.department | Faculty of Electronic Engineering, Menoufia University, Menouf, Egypt | |
local.contributor.department | Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russian Federation | |
local.identifier.pure | 11445972 | - |
local.identifier.pure | 9aaf9b4b-cdd2-4ec9-9e4b-1725edee5fa8 | uuid |
local.identifier.eid | 2-s2.0-85076254945 | - |
Располагается в коллекциях: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
2-s2.0-85076254945.pdf | 193,49 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.