{"id":"https://openalex.org/W185868636","doi":"https://doi.org/10.1007/978-3-642-37064-9_26","title":"On the Size Complexity of Deterministic Frequency Automata","display_name":"On the Size Complexity of Deterministic Frequency Automata","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W185868636","doi":"https://doi.org/10.1007/978-3-642-37064-9_26","mag":"185868636"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-37064-9_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5017606989","display_name":"R\u016bsi\u0146\u0161 Freivalds","orcid":"https://orcid.org/0000-0001-6192-3843"},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]},{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP","LV"],"is_corresponding":false,"raw_author_name":"R\u016bsi\u0146\u0161 Freivalds","raw_affiliation_strings":["Hokkaido University","University of Latvia"],"affiliations":[{"raw_affiliation_string":"University of Latvia","institution_ids":["https://openalex.org/I91123046"]},{"raw_affiliation_string":"Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103715395","display_name":"Thomas Zeugmann","orcid":null},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Thomas Zeugmann","raw_affiliation_strings":["Hokkaido University"],"affiliations":[{"raw_affiliation_string":"Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016254521","display_name":"Grant Pogosyan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grant R. Pogosyan","raw_affiliation_strings":["International Christian University."],"affiliations":[{"raw_affiliation_string":"International Christian University.","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":1.461,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":80},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"298"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"Automata Theory and Formal Languages","score":0.9999,"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":"Automata Theory and Formal Languages","score":0.9999,"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":"Active Learning in Machine Learning Research","score":0.9957,"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/T10181","display_name":"Statistical Machine Translation and Natural Language Processing","score":0.9943,"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/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.79954475},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.66028273},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.62211925},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5831602},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.578447},{"id":"https://openalex.org/keywords/neural-machine-translation","display_name":"Neural Machine Translation","score":0.530068},{"id":"https://openalex.org/keywords/synchronizing-automata","display_name":"Synchronizing Automata","score":0.52344},{"id":"https://openalex.org/keywords/combinatorics-on-words","display_name":"Combinatorics on Words","score":0.516507},{"id":"https://openalex.org/keywords/language-modeling","display_name":"Language Modeling","score":0.514888},{"id":"https://openalex.org/keywords/statistical-machine-translation","display_name":"Statistical Machine Translation","score":0.514599},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.47298276},{"id":"https://openalex.org/keywords/continuous-automaton","display_name":"Continuous automaton","score":0.46832517},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.44578022}],"concepts":[{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.9201379},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.815021},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.79954475},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.70627314},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6799446},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.66028273},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.62211925},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5831602},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.578447},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5279561},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.52184314},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.48720568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47414204},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.47298276},{"id":"https://openalex.org/C21720249","wikidata":"https://www.wikidata.org/wiki/Q5165460","display_name":"Continuous automaton","level":5,"score":0.46832517},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.44578022},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.41273078},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39327693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36186802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33927417},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.28289658},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26826116},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-37064-9_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality education","score":0.58}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1486095079","https://openalex.org/W1514544843","https://openalex.org/W1602649947","https://openalex.org/W1834767237","https://openalex.org/W1980411366","https://openalex.org/W1987537477","https://openalex.org/W2002089154","https://openalex.org/W2008781948","https://openalex.org/W2029293245","https://openalex.org/W2054801208","https://openalex.org/W2068666632","https://openalex.org/W2081260821","https://openalex.org/W2160493389","https://openalex.org/W2311242405","https://openalex.org/W2490884426","https://openalex.org/W3129458497","https://openalex.org/W421997344","https://openalex.org/W4236722199","https://openalex.org/W4302339081","https://openalex.org/W84763068"],"related_works":["https://openalex.org/W3194347685","https://openalex.org/W3191465415","https://openalex.org/W3153637812","https://openalex.org/W3135656023","https://openalex.org/W2522171317","https://openalex.org/W2155870982","https://openalex.org/W2042728676","https://openalex.org/W2026879508","https://openalex.org/W15413121","https://openalex.org/W1482505495"],"abstract_inverted_index":{"Austinat,":[0],"Diekert,":[1],"Hertrampf,":[2],"and":[3,41,94,175],"Petersen":[4],"[2]":[5,131],"proved":[6,133],"that":[7,11,20,85,112,134,142,166,189,202,210],"every":[8,135],"language":[9,49,56,61,69,97,107,136,178,184],"L":[10,70,75,110,137,179,187],"is":[12,50,63,105,143,182,213],"(m,n)-recognizable":[13],"by":[14,27,117,145,153,194],"a":[15,28,55,60,68,78,87,96,106,118,139,146,154,161,168,177,183,195],"deterministic":[16,29,38,43,88,119,147,155,169,196],"frequency":[17,39,89,148,170],"automaton":[18,31,90,121,149,171,198],"such":[19,111,188,209],"m":[21,100],">":[22,101],"n/2":[23],"can":[24,114,150,191],"be":[25,115,151,192],"recognized":[26,116,152,193],"finite":[30,44,79,120,156,197],"as":[32],"well.":[33],"First,":[34],"the":[35,47],"size":[36],"of":[37,42,54,67,81],"automata":[40,45],"recognizing":[46],"same":[48],"compared.":[51],"Then":[52],"approximations":[53,208],"are":[57,207],"considered,":[58],"where":[59,99],"L\u2032":[62,72,108,113,185,190],"called":[64],"an":[65],"approximation":[66],"if":[71,86,167],"differs":[73],"from":[74],"in":[76],"only":[77],"number":[80],"strings.":[82],"We":[83],"prove":[84],"has":[91,172],"k":[92,126,173,203],"states":[93,174],"(m,n)-recognizes":[95],"L,":[98],"n/2,":[102],"then":[103,180],"there":[104,181,206],"approximating":[109,186],"with":[122,199],"no":[123,200],"more":[124,201],"than":[125],"states.":[127,204],"Austinat":[128],"et":[129],"al.":[130],"also":[132],"over":[138,160],"single-letter":[140,162],"alphabet":[141,163],"(1,n)-recognizable":[144],"automaton.":[157],"For":[158],"languages":[159],"we":[164],"show":[165],"(1,n)-recognizes":[176],"However,":[205],"our":[211],"bound":[212],"much":[214],"higher,":[215],"i.e.,":[216],"k!.":[217]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W185868636","counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2024-11-18T22:16:41.490337","created_date":"2016-06-24"}