{"id":"https://openalex.org/W2104040325","doi":"https://doi.org/10.1142/s0129054114400164","title":"LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS","display_name":"LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2104040325","doi":"https://doi.org/10.1142/s0129054114400164","mag":"2104040325"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400164","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400164","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/A5063068146","display_name":"Arseny M. Shur","orcid":"https://orcid.org/0000-0002-7812-3399"},"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":"ARSENY M. SHUR","raw_affiliation_strings":["Department of Algebra and Discrete Mathematics, Ural Federal University, pr. Lenina 51, Ekaterinburg 620083, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Algebra and Discrete Mathematics, Ural Federal University, pr. Lenina 51, Ekaterinburg 620083, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063068146"],"corresponding_institution_ids":["https://openalex.org/I130823665"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14600232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"08","first_page":"937","last_page":"953"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9932000041007996,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9907000064849854,"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/alphabet","display_name":"Alphabet","score":0.6340717077255249},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5465660691261292},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5435672998428345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5319564342498779},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.5108282566070557},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.48793360590934753},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.48581480979919434},{"id":"https://openalex.org/keywords/canonical-form","display_name":"Canonical form","score":0.4845368266105652},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4745545983314514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4437795579433441},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4232599139213562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3562355935573578},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34651434421539307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22503656148910522},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18973153829574585},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14649444818496704}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6340717077255249},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5465660691261292},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5435672998428345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5319564342498779},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.5108282566070557},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.48793360590934753},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.48581480979919434},{"id":"https://openalex.org/C204707403","wikidata":"https://www.wikidata.org/wiki/Q1152398","display_name":"Canonical form","level":2,"score":0.4845368266105652},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4745545983314514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4437795579433441},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4232599139213562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3562355935573578},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34651434421539307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22503656148910522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18973153829574585},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14649444818496704},{"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":[{"id":"doi:10.1142/s0129054114400164","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400164","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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1514324498","https://openalex.org/W1533602140","https://openalex.org/W1967466192","https://openalex.org/W2052987310","https://openalex.org/W2116250539","https://openalex.org/W2126113681","https://openalex.org/W4205860192","https://openalex.org/W4242358482"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W1975910189","https://openalex.org/W2269685284","https://openalex.org/W2368684504","https://openalex.org/W2371400076","https://openalex.org/W2394954760","https://openalex.org/W4386400090","https://openalex.org/W277366380","https://openalex.org/W2057386223"],"abstract_inverted_index":{"We":[0,20,34],"study":[1],"FAD-languages,":[2],"which":[3],"are":[4,21],"regular":[5],"languages":[6],"defined":[7],"by":[8],"finite":[9],"sets":[10,39],"of":[11,29,38,40,58,99,127,140,149,155],"forbidden":[12,41],"factors,":[13],"together":[14],"with":[15,106,143,151],"their":[16],"\u201ccanonical\u201d":[17],"recognizing":[18],"automata.":[19,51],"mainly":[22],"interested":[23],"in":[24,93],"the":[25,49,97,113,122],"possible":[26],"asymptotic":[27],"orders":[28],"growth":[30,110,133],"for":[31],"such":[32,85],"languages.":[33],"analyze":[35],"certain":[36],"simplifications":[37],"factors":[42],"and":[43,55,148],"show":[44],"that":[45,65,83,121],"they":[46],"\u201calmost\u201d":[47],"preserve":[48],"canonical":[50,59,69,141],"Using":[52],"this":[53],"result":[54],"structural":[56],"properties":[57],"automata,":[60],"we":[61,116,136],"describe":[62],"an":[63,118],"algorithm":[64,89,123],"effectively":[66],"lists":[67],"all":[68],"automata":[70,86,142],"having":[71,130],"a":[72,78,100,103,107,128,131,144,152],"sink":[73],"strong":[74],"component":[75],"isomorphic":[76],"to":[77,95],"given":[79,104,108,132],"digraph,":[80],"or":[81],"reports":[82],"no":[84],"exist.":[87],"This":[88],"can":[90],"be":[91],"used,":[92],"particular,":[94],"prove":[96,125],"existence":[98],"FAD-language":[101,129],"over":[102],"alphabet":[105],"exponential":[109],"rate.":[111,134],"On":[112],"other":[114],"hand,":[115],"give":[117],"example":[119],"showing":[120],"cannot":[124],"non-existence":[126],"Finally,":[135],"provide":[137],"some":[138],"examples":[139],"nontrivial":[145],"condensation":[146],"graph":[147],"FAD-languages":[150],"\u201ccomplex\u201d":[153],"order":[154],"growth.":[156]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}