{"id":"https://openalex.org/W2036755336","doi":"https://doi.org/10.1142/s0129054113400157","title":"SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA","display_name":"SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2036755336","doi":"https://doi.org/10.1142/s0129054113400157","mag":"2036755336"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400157","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091392392","display_name":"Mikhail V. Berlinkov","orcid":"https://orcid.org/0000-0002-3903-0130"},"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":"MIKHAIL V. BERLINKOV","raw_affiliation_strings":["Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Computer Science, Ural Federal University, 620000 Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091392392"],"corresponding_institution_ids":["https://openalex.org/I130823665"],"apc_list":null,"apc_paid":null,"fwci":2.5517,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89322449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"06","first_page":"729","last_page":"745"},"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.9941999912261963,"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/T10126","display_name":"Logic, programming, and type systems","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/extension","display_name":"Extension (predicate logic)","score":0.7873865365982056},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.7127199769020081},{"id":"https://openalex.org/keywords/reset","display_name":"Reset (finance)","score":0.7022699117660522},{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.6999087929725647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6233199834823608},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5218766927719116},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47481977939605713},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4643998444080353},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.45872682332992554},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4565145969390869},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44393351674079895},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4433667063713074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3980860114097595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30775102972984314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2572811543941498},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.18048721551895142},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.13336551189422607}],"concepts":[{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.7873865365982056},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.7127199769020081},{"id":"https://openalex.org/C2779795794","wikidata":"https://www.wikidata.org/wiki/Q7315343","display_name":"Reset (finance)","level":2,"score":0.7022699117660522},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.6999087929725647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6233199834823608},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5218766927719116},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47481977939605713},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4643998444080353},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.45872682332992554},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4565145969390869},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44393351674079895},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4433667063713074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3980860114097595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30775102972984314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2572811543941498},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.18048721551895142},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.13336551189422607},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113400157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400157","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1207259902","https://openalex.org/W1487444668","https://openalex.org/W1593256541","https://openalex.org/W1991980356","https://openalex.org/W2023030024","https://openalex.org/W2034962669","https://openalex.org/W2037900755","https://openalex.org/W2051638203","https://openalex.org/W2053583025","https://openalex.org/W2062377295","https://openalex.org/W2122803069","https://openalex.org/W2140147014","https://openalex.org/W2171865517","https://openalex.org/W2962940319","https://openalex.org/W3122681364"],"related_works":["https://openalex.org/W2359328895","https://openalex.org/W2363535981","https://openalex.org/W2007402811","https://openalex.org/W2326762630","https://openalex.org/W2391354408","https://openalex.org/W1986103452","https://openalex.org/W2166562438","https://openalex.org/W2388558702","https://openalex.org/W2349570115","https://openalex.org/W2145224012"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,44,55,65],"new":[3],"version":[4],"of":[5,22,29,38,73,78],"the":[6,19,48,70,87,96],"so-called":[7],"extension":[8,50,97],"method":[9,51],"that":[10,86],"was":[11],"used":[12],"to":[13,47,95],"prove":[14],"quadratic":[15,66],"upper":[16,67],"bounds":[17,68],"on":[18,54,69],"minimum":[20,71],"length":[21,72],"reset":[23,74],"words":[24,75],"for":[25,76],"various":[26],"important":[27],"classes":[28],"synchronizing":[30],"automata.":[31,82],"Our":[32],"approach":[33,89],"is":[34,42,90],"formulated":[35],"in":[36,43,91],"terms":[37],"Markov":[39],"chains;":[40],"it":[41],"sense":[45,93],"dual":[46],"usual":[49],"and":[52,80],"improves":[53],"recent":[56],"result":[57],"by":[58],"Jungers.":[59],"As":[60],"an":[61],"application,":[62],"we":[63,84],"obtain":[64],"generalizations":[77],"Eulerian":[79],"one-cluster":[81],"Finally,":[83],"show":[85],"proposed":[88],"some":[92],"equivalent":[94],"method.":[98]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}