{"id":"https://openalex.org/W2137688090","doi":"https://doi.org/10.1142/s0129054113400108","title":"LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA","display_name":"LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2137688090","doi":"https://doi.org/10.1142/s0129054113400108","mag":"2137688090"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400108","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400108","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://elar.urfu.ru/handle/10995/112091","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067994724","display_name":"Vladimir V. Gusev","orcid":"https://orcid.org/0000-0002-2815-607X"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"VLADIMIR V. GUSEV","raw_affiliation_strings":["Institute of Mathematics and Computer Science, Ural Federal University, Lenina 51, Ekaterinburg, 620083, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Computer Science, Ural Federal University, Lenina 51, Ekaterinburg, 620083, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067994724"],"corresponding_institution_ids":["https://openalex.org/I130823665"],"apc_list":null,"apc_paid":null,"fwci":1.0936,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79986939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"02","first_page":"251","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reset","display_name":"Reset (finance)","score":0.9165877103805542},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.8087946176528931},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.7167125940322876},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7042008638381958},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6999639272689819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5352711081504822},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5277170538902283},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.49823975563049316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4941132366657257},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4895413815975189},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4737834930419922},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44701942801475525},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4353184103965759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3636888265609741},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.23425796627998352},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2066161334514618},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08735230565071106},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.05743172764778137}],"concepts":[{"id":"https://openalex.org/C2779795794","wikidata":"https://www.wikidata.org/wiki/Q7315343","display_name":"Reset (finance)","level":2,"score":0.9165877103805542},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.8087946176528931},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.7167125940322876},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7042008638381958},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6999639272689819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5352711081504822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5277170538902283},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.49823975563049316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4941132366657257},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4895413815975189},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4737834930419922},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44701942801475525},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4353184103965759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3636888265609741},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.23425796627998352},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2066161334514618},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08735230565071106},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.05743172764778137},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s0129054113400108","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400108","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:elar.urfu.ru:10995/112091","is_oa":true,"landing_page_url":"http://elar.urfu.ru/handle/10995/112091","pdf_url":null,"source":{"id":"https://openalex.org/S4406922546","display_name":"Electronic Archive of Ural Federal University (ELAR UrFU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1016.7337","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1016.7337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://elar.urfu.ru/bitstream/10995/27138/1/scopus-2013-0311.pdf","raw_type":"text"},{"id":"pmh:oai:elar.urfu.ru:10995/27138","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84878709355","pdf_url":null,"source":{"id":"https://openalex.org/S4406922546","display_name":"Electronic Archive of Ural Federal University (ELAR UrFU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:jah.su:record/13581","is_oa":false,"landing_page_url":"http://hdl.handle.net/10995/27138","pdf_url":null,"source":{"id":"https://openalex.org/S4306401523","display_name":"Electronic scientific archive of UrFU (Ural Federal University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130823665","host_organization_name":"Ural Federal University","host_organization_lineage":["https://openalex.org/I130823665"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:elar.urfu.ru:10995/112091","is_oa":true,"landing_page_url":"http://elar.urfu.ru/handle/10995/112091","pdf_url":null,"source":{"id":"https://openalex.org/S4406922546","display_name":"Electronic Archive of Ural Federal University (ELAR UrFU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1593256541","https://openalex.org/W1972887674","https://openalex.org/W2004666083","https://openalex.org/W2009589430","https://openalex.org/W2051638203","https://openalex.org/W2063549704","https://openalex.org/W2102194201","https://openalex.org/W2140147014"],"related_works":["https://openalex.org/W2155870982","https://openalex.org/W2042728676","https://openalex.org/W4289920164","https://openalex.org/W186350370","https://openalex.org/W2950792992","https://openalex.org/W3135656023","https://openalex.org/W3042269469","https://openalex.org/W2408583837","https://openalex.org/W2145224012","https://openalex.org/W2175473110"],"abstract_inverted_index":{"For":[0],"each":[1],"odd":[2],"n":[3,13],"\u2265":[4],"5":[5],"we":[6],"present":[7],"a":[8,39,43],"synchronizing":[9,40],"Eulerian":[10],"automaton":[11,41],"with":[12],"states":[14],"for":[15],"which":[16],"the":[17,35],"minimum":[18],"length":[19],"of":[20,38,45],"reset":[21,36],"words":[22],"is":[23],"equal":[24],"to":[25],"[Formula:":[26],"see":[27],"text].":[28],"We":[29],"also":[30],"discuss":[31],"various":[32],"connections":[33],"between":[34],"threshold":[37],"and":[42],"sequence":[44],"reachability":[46],"properties":[47],"in":[48],"its":[49],"underlying":[50],"graph.":[51]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}