{"id":"https://openalex.org/W2103779125","doi":"https://doi.org/10.3103/s0146411611070091","title":"On the reachability set of automaton counter machines","display_name":"On the reachability set of automaton counter machines","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2103779125","doi":"https://doi.org/10.3103/s0146411611070091","mag":"2103779125"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411611070091","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411611070091","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"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":"Automatic Control and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doaj.org/article/ac8a39bdc3c94f91a244f3156cd80589","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022065995","display_name":"E. V. Kuzmin","orcid":"https://orcid.org/0000-0003-0500-306X"},"institutions":[{"id":"https://openalex.org/I198371094","display_name":"Yaroslavl State University","ror":"https://ror.org/044s2fj67","country_code":"RU","type":"education","lineage":["https://openalex.org/I198371094"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"E. V. Kuzmin","raw_affiliation_strings":["Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, 150000, Russia","Yaroslavl State University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, 150000, Russia","institution_ids":["https://openalex.org/I198371094"]},{"raw_affiliation_string":"Yaroslavl State University#TAB#","institution_ids":["https://openalex.org/I198371094"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071222504","display_name":"D. Ju. Chalyy","orcid":"https://orcid.org/0000-0003-0553-7387"},"institutions":[{"id":"https://openalex.org/I198371094","display_name":"Yaroslavl State University","ror":"https://ror.org/044s2fj67","country_code":"RU","type":"education","lineage":["https://openalex.org/I198371094"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"D. J. Chalyy","raw_affiliation_strings":["Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, 150000, Russia","Yaroslavl State University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yaroslavl State University, ul. Sovetskaya 14, Yaroslavl, 150000, Russia","institution_ids":["https://openalex.org/I198371094"]},{"raw_affiliation_string":"Yaroslavl State University#TAB#","institution_ids":["https://openalex.org/I198371094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022065995"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.3191,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62036688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"45","issue":"7","first_page":"444","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9800999760627747,"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.9800999760627747,"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/T10211","display_name":"Computational Drug Discovery Methods","score":0.9782000184059143,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9520999789237976,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8267839550971985},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.7821700572967529},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.7703030109405518},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6973553895950317},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6839938163757324},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6410353183746338},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6293086409568787},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6144570112228394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.559526264667511},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4508426785469055},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.440066933631897},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3853600025177002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3825896382331848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36794447898864746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35505586862564087},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.24979737401008606},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.16841652989387512},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10200554132461548}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8267839550971985},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.7821700572967529},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.7703030109405518},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6973553895950317},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6839938163757324},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6410353183746338},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6293086409568787},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6144570112228394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.559526264667511},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4508426785469055},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.440066933631897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3853600025177002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3825896382331848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36794447898864746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35505586862564087},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.24979737401008606},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.16841652989387512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10200554132461548},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3103/s0146411611070091","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411611070091","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"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":"Automatic Control and Computer Sciences","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ac8a39bdc3c94f91a244f3156cd80589","is_oa":true,"landing_page_url":"https://doaj.org/article/ac8a39bdc3c94f91a244f3156cd80589","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\u041c\u043e\u0434\u0435\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u0430\u043d\u0430\u043b\u0438\u0437 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c, Vol 17, Iss 1, Pp 52-64 (2010)","raw_type":"article"},{"id":"pmh:oai:doaj.org/article:bffe0971efbb469aa292697fd4834739","is_oa":true,"landing_page_url":"https://doaj.org/article/bffe0971efbb469aa292697fd4834739","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\u041c\u043e\u0434\u0435\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u0430\u043d\u0430\u043b\u0438\u0437 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c, Vol 16, Iss 3, Pp 77-84 (2009)","raw_type":"article"},{"id":"pmh:oai:oai.mais.elpub.ru:article/953","is_oa":true,"landing_page_url":"https://www.mais-journal.ru/jour/article/view/953","pdf_url":null,"source":{"id":"https://openalex.org/S2739003635","display_name":"Modeling and Analysis of Information Systems","issn_l":"1818-1015","issn":["1818-1015","2313-5417"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310312652","host_organization_name":"Yaroslavl State University","host_organization_lineage":["https://openalex.org/P4310312652"],"host_organization_lineage_names":["Yaroslavl State University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Modeling and Analysis of Information Systems; \u0422\u043e\u043c 16, \u2116 3 (2009); 77-84","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:doaj.org/article:ac8a39bdc3c94f91a244f3156cd80589","is_oa":true,"landing_page_url":"https://doaj.org/article/ac8a39bdc3c94f91a244f3156cd80589","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\u041c\u043e\u0434\u0435\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u0430\u043d\u0430\u043b\u0438\u0437 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c, Vol 17, Iss 1, Pp 52-64 (2010)","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W156955290","https://openalex.org/W600072479","https://openalex.org/W1531261972","https://openalex.org/W1546101340","https://openalex.org/W1547584984","https://openalex.org/W1580879785","https://openalex.org/W1821880317","https://openalex.org/W1835325438","https://openalex.org/W1971231744","https://openalex.org/W2008435081","https://openalex.org/W2012140001","https://openalex.org/W2017315323","https://openalex.org/W2023999667","https://openalex.org/W2027710994","https://openalex.org/W2148224873","https://openalex.org/W2164003033"],"related_works":["https://openalex.org/W186350370","https://openalex.org/W2155870982","https://openalex.org/W2522171317","https://openalex.org/W2042728676","https://openalex.org/W1482505495","https://openalex.org/W2949259285","https://openalex.org/W2321527407","https://openalex.org/W325265439","https://openalex.org/W3042269469","https://openalex.org/W2905821389"],"abstract_inverted_index":{"Properties":[0],"of":[1,9,12,37],"automaton":[2,14,40,46],"counter":[3,41,47],"machines":[4],"are":[5,49],"considered.":[6],"The":[7],"set":[8,29],"reachability":[10,35],"states":[11],"any":[13,38,44],"one-counter":[15],"machine":[16,42,48],"is":[17,30],"proved":[18],"to":[19],"be":[20],"a":[21],"semilinear":[22],"set.":[23],"An":[24],"algorithm":[25],"for":[26],"constructing":[27],"this":[28],"described.":[31],"In":[32],"addition,":[33],"the":[34],"sets":[36],"reversal-bounded":[39],"and":[43],"flat":[45],"also":[50],"semilinear.":[51]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}