1. Электронный научный архив УрФУ
  2. 00. Общеуниверситетские коллекции
  3. Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC
Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/101934
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBondar, E. A.en
dc.contributor.authorVolkov, M. V.en
dc.date.accessioned2021-08-31T15:00:44Z-
dc.date.available2021-08-31T15:00:44Z-
dc.date.issued2018-
dc.identifier.citationBondar E. A. A Characterization of Completely Reachable Automata / E. A. Bondar, M. V. Volkov. — DOI 10.1007/978-3-319-98654-8_12 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2018. — Vol. 11088 LNCS. — P. 145-155.en
dc.identifier.isbn9783319986531-
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-85053869629&doi=10.1007%2f978-3-319-98654-8_12&partnerID=40&md5=fe663d8b81fa73c171273d4cab96a017
dc.identifier.otherhttp://arxiv.org/pdf/1805.02879m
dc.identifier.urihttp://elar.urfu.ru/handle/10995/101934-
dc.description.abstractA complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely reachable automata in terms of certain directed graphs. © 2018, Springer Nature Switzerland AG.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.subjectCOMPLETE REACHABILITYen
dc.subjectDETERMINISTIC FINITE AUTOMATONen
dc.subjectDIRECTED GRAPHSen
dc.subjectDETERMINISTIC FINITE AUTOMATAen
dc.subjectREACHABILITYen
dc.subjectSTATE-SETSen
dc.subjectAUTOMATA THEORYen
dc.titleA Characterization of Completely Reachable Automataen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.rsi35731589-
dc.identifier.doi10.1007/978-3-319-98654-8_12-
dc.identifier.scopus85053869629-
local.contributor.employeeBondar, E.A., Institute of Natural Sciences and Mathematics, Ural Federal University, Lenina 51, Ekaterinburg, 620000, Russian Federation
local.contributor.employeeVolkov, M.V., Institute of Natural Sciences and Mathematics, Ural Federal University, Lenina 51, Ekaterinburg, 620000, Russian Federation
local.description.firstpage145-
local.description.lastpage155-
local.volume11088 LNCS-
dc.identifier.wos000905585400012-
local.contributor.departmentInstitute of Natural Sciences and Mathematics, Ural Federal University, Lenina 51, Ekaterinburg, 620000, Russian Federation
local.identifier.pure3fc8653e-9592-4626-9bc3-5f3e03dd3578uuid
local.identifier.pure7898495-
local.identifier.eid2-s2.0-85053869629-
local.identifier.wosWOS:000905585400012-
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85053869629.pdf153,75 kBAdobe PDFView/Open
Show simple item record   Google Scholar





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