Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/112096
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ananichev, D. S. | en |
dc.contributor.author | Volkov, M. V. | en |
dc.contributor.author | Zaks, Yu. I. | en |
dc.date.accessioned | 2022-05-12T08:27:59Z | - |
dc.date.available | 2022-05-12T08:27:59Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Ananichev D. S. Synchronizing Automata with a Letter of Deficiency 2 / D. S. Ananichev, M. V. Volkov, Yu. I. Zaks // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2006. — Vol. 4036 LNCS. — P. 433-442. | en |
dc.identifier.isbn | 354035428X | - |
dc.identifier.isbn | 9783540354284 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.other | All Open Access, Green | 3 |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/112096 | - |
dc.description.abstract | We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Černý's construction. © Springer-Verlag Berlin Heidelberg 2006. | en |
dc.description.sponsorship | This work was supported by the Russian Foundation for Basic Research, grant 05-01-00540. | en |
dc.format.mimetype | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Springer Verlag | en1 |
dc.publisher | Springer Berlin Heidelberg | 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 | COMPUTER SCIENCE | en |
dc.subject | FORMAL LANGUAGES | en |
dc.subject | PROBLEM SOLVING | en |
dc.subject | SYNCHRONIZATION | en |
dc.subject | DEFICIENCY 2 | en |
dc.subject | INFINITE SERIES | en |
dc.subject | RESET WORDS | en |
dc.subject | AUTOMATA THEORY | en |
dc.title | Synchronizing Automata with a Letter of Deficiency 2 | en |
dc.type | Conference Paper | en |
dc.type | info:eu-repo/semantics/conferenceObject | en |
dc.type | info:eu-repo/semantics/publishedVersion | en |
dc.conference.name | 10th International Conference on Developments in Language Theory, DLT 2006 | en |
dc.conference.date | 26 June 2006 through 29 June 2006 | - |
dc.identifier.scopus | 33746215726 | - |
local.contributor.employee | Ananichev, D.S., Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russian Federation; Volkov, M.V., Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russian Federation; Zaks, Yu.I., Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russian Federation | en |
local.description.firstpage | 433 | - |
local.description.lastpage | 442 | - |
local.volume | 4036 LNCS | - |
dc.identifier.wos | 000239454100039 | - |
local.contributor.department | Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russian Federation | en |
local.identifier.pure | 7882422 | - |
local.identifier.eid | 2-s2.0-33746215726 | - |
local.fund.rffi | 05-01-00540 | - |
local.identifier.wos | WOS:000239454100039 | - |
Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2-s2.0-33746215726.pdf | 407,46 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.