{"id":"https://openalex.org/W2081320746","doi":"https://doi.org/10.1051/ita/2012021","title":"<i>k</i>-counting automata","display_name":"<i>k</i>-counting automata","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2081320746","doi":"https://doi.org/10.1051/ita/2012021","mag":"2081320746"},"language":"en","primary_location":{"id":"doi:10.1051/ita/2012021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2012021","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5035320124","display_name":"Joel D. Allred","orcid":"https://orcid.org/0009-0006-7286-5574"},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Jo\u00ebl Allred","raw_affiliation_strings":["Department of Computer Science, University of Fribourg, Boulevard de P\u00e9rolles 90, 1700 Fribourg, Switzerland,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Fribourg, Boulevard de P\u00e9rolles 90, 1700 Fribourg, Switzerland,","institution_ids":["https://openalex.org/I154338468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037228059","display_name":"Ulrich Ultes\u2010Nitsche","orcid":"https://orcid.org/0000-0002-5835-9572"},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ulrich Ultes-Nitsche","raw_affiliation_strings":["Department of Computer Science, University of Fribourg, Boulevard de P\u00e9rolles 90, 1700 Fribourg, Switzerland,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Fribourg, Boulevard de P\u00e9rolles 90, 1700 Fribourg, Switzerland,","institution_ids":["https://openalex.org/I154338468"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035320124"],"corresponding_institution_ids":["https://openalex.org/I154338468"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14013728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"46","issue":"4","first_page":"461","last_page":"478"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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/decidability","display_name":"Decidability","score":0.8563607931137085},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6794629096984863},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.5904545187950134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5407962203025818},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5209904313087463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5074233412742615},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5069406032562256},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4817940592765808},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44912341237068176},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4306719899177551},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42546722292900085},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3751547932624817},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33730459213256836},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.302140474319458},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2586243152618408},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2245248258113861},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13405922055244446}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8563607931137085},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6794629096984863},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.5904545187950134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5407962203025818},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5209904313087463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5074233412742615},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5069406032562256},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4817940592765808},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44912341237068176},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4306719899177551},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42546722292900085},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3751547932624817},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33730459213256836},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.302140474319458},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2586243152618408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2245248258113861},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13405922055244446},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita/2012021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2012021","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2012__46_4_461_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ita/2012021/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.4300000071525574,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1560050980","https://openalex.org/W1976772375","https://openalex.org/W1990609140","https://openalex.org/W2002662108","https://openalex.org/W2011495892","https://openalex.org/W2011839081","https://openalex.org/W2019881090","https://openalex.org/W2047764386","https://openalex.org/W2049848227","https://openalex.org/W2054098888","https://openalex.org/W2061970672","https://openalex.org/W2073614038","https://openalex.org/W2094912129","https://openalex.org/W2106001218","https://openalex.org/W2138856440","https://openalex.org/W2151259840","https://openalex.org/W2172290937","https://openalex.org/W2914206182","https://openalex.org/W4250884204"],"related_works":["https://openalex.org/W2950141706","https://openalex.org/W1965531865","https://openalex.org/W2401586919","https://openalex.org/W1974626062","https://openalex.org/W4381706435","https://openalex.org/W2008821042","https://openalex.org/W2154230112","https://openalex.org/W2182252111","https://openalex.org/W2032030062","https://openalex.org/W2798603509"],"abstract_inverted_index":{"In":[0,33],"this":[1],"paper,":[2],"we":[3,35,63,75],"define":[4],"k-counting":[5,41,60],"automata":[6,42],"as":[7],"recognizers":[8],"for":[9,59],"\u03c9-languages,":[10],"i.e.":[11],"languages":[12,38],"of":[13,21,29],"infinite":[14],"words.":[15],"We":[16],"prove":[17,36],"that":[18,37,66],"the":[19,30],"class":[20],"\u03c9-languages":[22],"they":[23],"recognize":[24],"is":[25,57,68],"a":[26],"proper":[27],"extension":[28],"\u03c9-regular":[31],"languages.":[32],"addition":[34],"recognized":[39],"by":[40],"are":[43],"closed":[44],"under":[45],"Boolean":[46],"operations.":[47],"It":[48],"remains":[49],"an":[50],"open":[51],"problem":[52],"whether":[53],"or":[54],"not":[55],"emptiness":[56],"decidable":[58,69],"automata.":[61],"However,":[62],"conjecture":[64],"strongly":[65],"it":[67],"and":[70],"give":[71],"formal":[72],"reasons":[73],"why":[74],"believe":[76],"so.":[77]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}