Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102436
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaslennikova, M.en
dc.date.accessioned2021-08-31T15:03:37Z-
dc.date.available2021-08-31T15:03:37Z-
dc.date.issued2014-
dc.identifier.citationMaslennikova M. Complexity of checking whether two automata are synchronized by the same language / M. Maslennikova. — DOI 10.1007/978-3-319-09704-6_27 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2014. — Vol. 8614 LNCS. — P. 306-317.en
dc.identifier.isbn9783319097039-
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-84905392482&doi=10.1007%2f978-3-319-09704-6_27&partnerID=40&md5=451e35499522c7addeff1f4e98102c06
dc.identifier.otherhttp://arxiv.org/pdf/1405.3576m
dc.identifier.urihttp://hdl.handle.net/10995/102436-
dc.description.abstractA deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton A to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton. © 2014 Springer International Publishing.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.subjectSYNCHRONIZATIONen
dc.subjectIDEAL LANGUAGEen
dc.subjectPSPACE COMPLETENESSen
dc.subjectRESET COMPLEXITYen
dc.subjectRESET WORDSen
dc.subjectSYNCHRONIZING AUTOMATAen
dc.subjectAUTOMATA THEORYen
dc.titleComplexity of checking whether two automata are synchronized by the same languageen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1007/978-3-319-09704-6_27-
dc.identifier.scopus84905392482-
local.contributor.employeeMaslennikova, M., Ural Federal University, Ekaterinburg, Russian Federation
local.description.firstpage306-
local.description.lastpage317-
local.volume8614 LNCS-
local.contributor.departmentUral Federal University, Ekaterinburg, Russian Federation
local.identifier.pure540101-
local.identifier.pure4a0afc97-f005-4fc2-bf51-0df6b234ac5cuuid
local.identifier.eid2-s2.0-84905392482-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84905392482.pdf176,33 kBAdobe PDFView/Open


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