Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/102274
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Chistikov, D. | en |
dc.contributor.author | Martyugin, P. | en |
dc.contributor.author | Shirmohammadi, M. | en |
dc.date.accessioned | 2021-08-31T15:02:55Z | - |
dc.date.available | 2021-08-31T15:02:55Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Chistikov D. Synchronizing automata over nested words / D. Chistikov, P. Martyugin, M. Shirmohammadi. — DOI 10.1007/978-3-662-49630-5_15 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2016. — Vol. 9634. — P. 252-268. | en |
dc.identifier.isbn | 9783662496299 | - |
dc.identifier.issn | 3029743 | - |
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-84961712561&doi=10.1007%2f978-3-662-49630-5_15&partnerID=40&md5=074c9005e176c70da484c2d70160971c | |
dc.identifier.other | https://hal.archives-ouvertes.fr/hal-02411524/document | m |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/102274 | - |
dc.description.abstract | We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i.e., takes the NWA from all control states to a single control state. We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in the size of the NWA, the existence of such a word can still be decided in polynomial time. As our main contribution, we show that deciding the existence of a short synchronizing word (of at most given length) becomes PSPACE-complete (as opposed to NP-complete for DFA). The upper bound makes a connection to pebble games and Strahler numbers, and the lower bound goes via small-cost synchronizing words for DFA, an intermediate problem that we also show PSPACE-complete. We also characterize the complexity of a number of related problems, using the observation that the intersection nonemptiness problem for NWA is EXP-complete. © Springer-Verlag Berlin Heidelberg 2016. | en |
dc.format.mimetype | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Springer Verlag | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.source | Lect. Notes Comput. Sci. | 2 |
dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en |
dc.subject | AUTOMATA THEORY | en |
dc.subject | POLYNOMIAL APPROXIMATION | en |
dc.subject | SYNCHRONIZATION | en |
dc.subject | CONTROL STATE | en |
dc.subject | DETERMINISTIC FINITE STATE AUTOMATA | en |
dc.subject | LOWER BOUNDS | en |
dc.subject | POLYNOMIAL-TIME | en |
dc.subject | PSPACE-COMPLETE | en |
dc.subject | SYNCHRONIZING AUTOMATA | en |
dc.subject | SYNCHRONIZING WORDS | en |
dc.subject | WORD AUTOMATA | en |
dc.subject | FINITE AUTOMATA | en |
dc.title | Synchronizing automata over nested words | 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-662-49630-5_15 | - |
dc.identifier.scopus | 84961712561 | - |
local.contributor.employee | Chistikov, D., Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbrücken, Germany | |
local.contributor.employee | Martyugin, P., Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russian Federation | |
local.contributor.employee | Shirmohammadi, M., University of Oxford, Oxford, United Kingdom | |
local.description.firstpage | 252 | - |
local.description.lastpage | 268 | - |
local.volume | 9634 | - |
local.contributor.department | Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbrücken, Germany | |
local.contributor.department | Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russian Federation | |
local.contributor.department | University of Oxford, Oxford, United Kingdom | |
local.identifier.pure | 738598 | - |
local.identifier.pure | eb0feb23-0b0b-4ce7-baae-45ad152af027 | uuid |
local.identifier.eid | 2-s2.0-84961712561 | - |
Располагается в коллекциях: | Научные публикации, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
2-s2.0-84961712561.pdf | 937,18 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.