{"id":"https://openalex.org/W2016532328","doi":"https://doi.org/10.3103/s0146411611070108","title":"On languages of automaton counter machines","display_name":"On languages of automaton counter machines","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2016532328","doi":"https://doi.org/10.3103/s0146411611070108","mag":"2016532328"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411611070108","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411611070108","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/fe76d43605ea4b23865a1623ed2b8b25","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, Yaroslavl, Russia","Yaroslavl State University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yaroslavl State University, Yaroslavl, 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":true,"raw_author_name":"D. J. Chalyy","raw_affiliation_strings":["Yaroslavl State University, Yaroslavl, Russia","Yaroslavl State University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yaroslavl State University, Yaroslavl, 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","https://openalex.org/A5071222504"],"corresponding_institution_ids":["https://openalex.org/I198371094"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09617561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"45","issue":"7","first_page":"469","last_page":"484"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9979000091552734,"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/computer-science","display_name":"Computer science","score":0.6146144866943359},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.6126942038536072},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5697745680809021},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.5466417074203491},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5129851698875427},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.49836063385009766},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4932789206504822},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4716213047504425},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.4691328704357147},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4346977472305298},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.43012842535972595},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.41823044419288635},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.38405272364616394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3708813786506653},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.32884490489959717},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30956053733825684},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27288681268692017},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.23738130927085876},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.11147591471672058},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10605952143669128},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.10419133305549622},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.10347574949264526},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.08164501190185547}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6146144866943359},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.6126942038536072},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5697745680809021},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.5466417074203491},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5129851698875427},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.49836063385009766},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4932789206504822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4716213047504425},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.4691328704357147},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4346977472305298},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.43012842535972595},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.41823044419288635},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.38405272364616394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3708813786506653},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.32884490489959717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30956053733825684},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27288681268692017},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.23738130927085876},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.11147591471672058},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10605952143669128},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.10419133305549622},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.10347574949264526},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.08164501190185547}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3103/s0146411611070108","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411611070108","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:fe76d43605ea4b23865a1623ed2b8b25","is_oa":true,"landing_page_url":"https://doaj.org/article/fe76d43605ea4b23865a1623ed2b8b25","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 2, Pp 48-71 (2010)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:doaj.org/article:fe76d43605ea4b23865a1623ed2b8b25","is_oa":true,"landing_page_url":"https://doaj.org/article/fe76d43605ea4b23865a1623ed2b8b25","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 2, Pp 48-71 (2010)","raw_type":"article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1577059114","https://openalex.org/W1965726041","https://openalex.org/W1967174286","https://openalex.org/W1970398023","https://openalex.org/W2002089154","https://openalex.org/W2016206602","https://openalex.org/W2076508310","https://openalex.org/W2123910665","https://openalex.org/W2316437449","https://openalex.org/W2442545619","https://openalex.org/W4253103663"],"related_works":["https://openalex.org/W1536687913","https://openalex.org/W1584306444","https://openalex.org/W2022934640","https://openalex.org/W2155870982","https://openalex.org/W2472752294","https://openalex.org/W2519069132","https://openalex.org/W1990051509","https://openalex.org/W2023439061","https://openalex.org/W1486486721","https://openalex.org/W4295836506"],"abstract_inverted_index":{"A":[0,113],"class":[1,14,42],"of":[2,25,48,85,89,91,105,109,118],"formal":[3],"languages":[4,49,110,119],"(ACML)":[5],"acceptable":[6],"by":[7,95],"automaton":[8,97],"counter":[9,98],"machines":[10],"is":[11,15,43,61,70,126],"considered.":[12],"This":[13],"shown":[16],"to":[17,22,65,75],"be":[18],"close":[19,62],"with":[20,51,63,73,115],"respect":[21,64,74],"the":[23,53,59,80,83,103],"operations":[24],"union,":[26],"regular":[27],"intersection,":[28],"concatenation,":[29],"infinite":[30],"iteration,":[31],"homomorphism,":[32],"and":[33,67,77,87,107,123],"inverse":[34],"homomorphism.":[35],"It":[36],"follows":[37],"from":[38,56],"here":[39],"that":[40],"this":[41],"a":[44,92],"full":[45],"abstract":[46],"family":[47],"[7]":[50],"all":[52],"properties":[54],"following":[55],"this.":[57],"Furthermore,":[58],"ACML":[60,81],"intersection":[66],"substitution":[68],"but":[69,102],"not":[71],"closed":[72],"complement":[76],"reverse.":[78],"For":[79],"class,":[82],"problems":[84,104],"emptiness":[86],"recognition":[88],"words":[90],"language":[93],"given":[94],"an":[96],"machine":[99],"are":[100,111],"decidable,":[101],"inclusion":[106],"equivalence":[108],"undecidable.":[112],"comparison":[114],"other":[116],"classes":[117],"(regular,":[120],"context-free,":[121],"context-sensitive,":[122],"Petri-net":[124],"languages)":[125],"performed.":[127]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}
