{"id":"https://openalex.org/W2212399862","doi":"https://doi.org/10.1134/s0361768815060031","title":"Analysis of a graph by a set of automata","display_name":"Analysis of a graph by a set of automata","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2212399862","doi":"https://doi.org/10.1134/s0361768815060031","mag":"2212399862"},"language":"en","primary_location":{"id":"doi:10.1134/s0361768815060031","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768815060031","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025016186","display_name":"I. B. Bourdonov","orcid":"https://orcid.org/0000-0001-9539-7853"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"I. B. Bourdonov","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","Institute for System Programming, Russian Academy of Sciences, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]},{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052011212","display_name":"A. S. Kossatchev","orcid":"https://orcid.org/0000-0001-5316-3813"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. S. Kossatchev","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","Institute for System Programming, Russian Academy of Sciences, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]},{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009423529","display_name":"V. V. Kulyamin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"V. V. Kulyamin","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","Institute for System Programming, Russian Academy of Sciences, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]},{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025016186"],"corresponding_institution_ids":["https://openalex.org/I4210101868"],"apc_list":null,"apc_paid":null,"fwci":0.7266,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75460277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"6","first_page":"307","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.603955090045929},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5815938711166382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5479282736778259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5423165559768677},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5193501710891724},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.48867300152778625},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.47541218996047974},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46712619066238403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4137500822544098},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4131201207637787},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4032650291919708},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3753117620944977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3717043995857239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3564484119415283},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1950002908706665}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.603955090045929},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5815938711166382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5479282736778259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5423165559768677},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5193501710891724},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.48867300152778625},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.47541218996047974},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46712619066238403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4137500822544098},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4131201207637787},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4032650291919708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3753117620944977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3717043995857239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3564484119415283},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1950002908706665},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s0361768815060031","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768815060031","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1992286012","https://openalex.org/W2026884583","https://openalex.org/W2318345139","https://openalex.org/W4245497568"],"related_works":["https://openalex.org/W1973688188","https://openalex.org/W2350995997","https://openalex.org/W3010027023","https://openalex.org/W2371151138","https://openalex.org/W2483136700","https://openalex.org/W2052731309","https://openalex.org/W2366079443","https://openalex.org/W1976942202","https://openalex.org/W1598633555","https://openalex.org/W4285593212"],"abstract_inverted_index":{"An":[0],"algorithm":[1,72],"of":[2,5,11,22,30,38,54,61,70,86,88,95,103,114],"traversal":[3],"(retrieval":[4],"full":[6,112],"information":[7],"on":[8],"the":[9,28,36,39,48,51,58,66,71,84,89,93,101,104,115],"structure)":[10],"an":[12,19],"a":[13],"priori":[14],"unknown":[15],"directed":[16],"graph":[17,40],"by":[18,77],"unbounded":[20],"set":[21],"finite":[23],"automata":[24],"that":[25,50],"interact":[26],"through":[27],"exchange":[29],"messages":[31,63],"and":[32,57,98],"can":[33],"move":[34],"along":[35],"arcs":[37],"according":[41],"to":[42],"their":[43],"direction":[44],"is":[45,73,83,92,100,109],"described.":[46],"Under":[47],"assumption":[49],"execution":[52],"time":[53,60,69],"basic":[55],"operations":[56],"transmission":[59],"individual":[62],"are":[64],"bounded,":[65,74],"total":[67],"operating":[68],"at":[75],"worst,":[76],"O(m":[78],"+":[79],"nd),":[80],"where":[81],"n":[82],"number":[85,94],"vertices":[87],"graph,":[90],"m":[91],"its":[96],"arcs,":[97],"d":[99],"diameter":[102],"graph;":[105],"moreover,":[106],"this":[107,119],"estimate":[108],"unimprovable.":[110],"The":[111],"proofs":[113],"propositions":[116],"formulated":[117],"in":[118,124],"paper":[120],"have":[121],"been":[122],"published":[123],"[6].":[125]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-02T13:48:15.688549","created_date":"2025-10-10T00:00:00"}