Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102109
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaslennikova, M.en
dc.date.accessioned2021-08-31T15:01:50Z-
dc.date.available2021-08-31T15:01:50Z-
dc.date.issued2017-
dc.identifier.citationMaslennikova M. Reset complexity of ideal languages over a binary alphabet / M. Maslennikova. — DOI 10.1007/978-3-319-60252-3_21 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2017. — Vol. 10316 LNCS. — P. 262-273.en
dc.identifier.isbn9783319602516-
dc.identifier.issn3029743-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Green3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85022324516&doi=10.1007%2f978-3-319-60252-3_21&partnerID=40&md5=bd8408eac558110b5d6ab0ee249b1a73
dc.identifier.otherhttps://elar.urfu.ru/bitstream/10995/89984/1/10.1142-S0129054119400343.pdfm
dc.identifier.urihttp://hdl.handle.net/10995/102109-
dc.description.abstractWe prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. © IFIP International Federation for Information Processing 2017.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceLect. Notes Comput. Sci.2
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectIDEAL LANGUAGEen
dc.subjectPSPACE-COMPLETENESSen
dc.subjectRESET COMPLEXITYen
dc.subjectRESET WORDen
dc.subjectSYNCHRONIZING AUTOMATONen
dc.subjectDISPERSION COMPENSATIONen
dc.subjectIDEAL LANGUAGEen
dc.subjectPSPACE COMPLETENESSen
dc.subjectRESET COMPLEXITYen
dc.subjectRESET WORDSen
dc.subjectSYNCHRONIZING AUTOMATAen
dc.subjectBINSen
dc.titleReset complexity of ideal languages over a binary alphabeten
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1007/978-3-319-60252-3_21-
dc.identifier.scopus85022324516-
local.contributor.employeeMaslennikova, M., Ural Federal University, Ekaterinburg, Russian Federation
local.description.firstpage262-
local.description.lastpage273-
local.volume10316 LNCS-
local.contributor.departmentUral Federal University, Ekaterinburg, Russian Federation
local.identifier.pure1977936-
local.identifier.pure83975bd9-d48a-4f69-9881-f144ddec6299uuid
local.identifier.eid2-s2.0-85022324516-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85022324516.pdf524,55 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.