Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/102327
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Maslennikova, M. | en |
dc.contributor.author | Rodaro, E. | en |
dc.date.accessioned | 2021-08-31T15:03:10Z | - |
dc.date.available | 2021-08-31T15:03:10Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Maslennikova M. Representation of (Left) ideal regular languages by synchronizing automata / M. Maslennikova, E. Rodaro. — DOI 10.1007/978-3-319-20297-6_21 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2015. — Vol. 9139. — P. 325-338. | en |
dc.identifier.isbn | 9783319202969 | - |
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-84950129706&doi=10.1007%2f978-3-319-20297-6_21&partnerID=40&md5=6708c6c040b4336b31700e2e4a0287f3 | |
dc.identifier.other | http://arxiv.org/pdf/1412.6767 | m |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/102327 | - |
dc.description.abstract | We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal language. Also we show a strict connection between principal left ideals and synchronizing automata. Actually, it is proved that all strongly connected synchronizing automata are homomorphic images of automata recognizing languages which are left quotients of principal left ideal languages. This result gives a restatement of Černý’s conjecture in terms of length of the shortest reset words of special quotients of automata in this class. Also in the present paper we characterize regular languages whose minimal deterministic finite automaton is synchronizing and possesses a reset word belonging to the recognized language. This characterization shows a connection with the notion of constant of a language introduced by Schützenberger. © Springer International Publishing Switzerland 2015. | 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 | IDEAL LANGUAGE | en |
dc.subject | RESET COMPLEXITY | en |
dc.subject | RESET LEFT REGULAR DECOMPOSITION | en |
dc.subject | RESET WORD | en |
dc.subject | STRONGLY CONNECTED AUTOMATON | en |
dc.subject | SYNCHRONIZING AUTOMATON | en |
dc.subject | AUTOMATA THEORY | en |
dc.subject | SYNCHRONIZATION | en |
dc.subject | IDEAL LANGUAGE | en |
dc.subject | REGULAR DECOMPOSITION | en |
dc.subject | RESET COMPLEXITY | en |
dc.subject | RESET WORDS | en |
dc.subject | STRONGLY CONNECTED AUTOMATONS | en |
dc.subject | SYNCHRONIZING AUTOMATA | en |
dc.subject | COMPUTATIONAL LINGUISTICS | en |
dc.title | Representation of (Left) ideal regular languages by synchronizing 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-319-20297-6_21 | - |
dc.identifier.scopus | 84950129706 | - |
local.contributor.employee | Maslennikova, M., Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russian Federation | |
local.contributor.employee | Rodaro, E., Centro de Matemática, Universidade do Porto, Porto, 4169-007, Portugal | |
local.description.firstpage | 325 | - |
local.description.lastpage | 338 | - |
local.volume | 9139 | - |
local.contributor.department | Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russian Federation | |
local.contributor.department | Centro de Matemática, Universidade do Porto, Porto, 4169-007, Portugal | |
local.identifier.pure | 567528 | - |
local.identifier.pure | b1916737-bcc3-4a8f-a453-039e27313b82 | uuid |
local.identifier.eid | 2-s2.0-84950129706 | - |
Располагается в коллекциях: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
2-s2.0-84950129706.pdf | 260,81 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.