{"id":"https://openalex.org/W3007499230","doi":"https://doi.org/10.1093/logcom/exaa007","title":"Lower bounds for the state complexity of probabilistic languages and the language of prime numbers","display_name":"Lower bounds for the state complexity of probabilistic languages and the language of prime numbers","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3007499230","doi":"https://doi.org/10.1093/logcom/exaa007","mag":"3007499230"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exaa007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaa007","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5022821778","display_name":"Nathana\u00ebl Fijalkow","orcid":"https://orcid.org/0000-0002-6576-4680"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nathana\u00cbl Fijalkow","raw_affiliation_strings":["CNRS, LaBRI, Talence, 33405 Bordeaux, France and The Alan Turing Institute of Data Science and Artificial Intelligence, London","CNRS - Centre National de la Recherche Scientifique (France)","LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Lib\u00e9ration 33405 Talence Cedex - France)"],"affiliations":[{"raw_affiliation_string":"CNRS, LaBRI, Talence, 33405 Bordeaux, France and The Alan Turing Institute of Data Science and Artificial Intelligence, London","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210160189","https://openalex.org/I4210142254","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS - Centre National de la Recherche Scientifique (France)","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LaBRI - Laboratoire Bordelais de Recherche en Informatique (Domaine Universitaire 351, cours de la Lib\u00e9ration 33405 Talence Cedex - France)","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022821778"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04548736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"1","first_page":"175","last_page":"192"},"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.9979000091552734,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9973000288009644,"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/complexity-class","display_name":"Complexity class","score":0.6789554953575134},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5955120921134949},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.5866715312004089},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5653641223907471},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5470840930938721},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5380522608757019},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.5262369513511658},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5095389485359192},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4986228942871094},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.49163156747817993},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4889880418777466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4657227694988251},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.4588736593723297},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.438017874956131},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4247596263885498},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.41631200909614563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40661343932151794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37680453062057495},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3221741318702698},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2714523673057556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22436565160751343},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07005113363265991}],"concepts":[{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6789554953575134},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5955120921134949},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.5866715312004089},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5653641223907471},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5470840930938721},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5380522608757019},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.5262369513511658},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5095389485359192},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4986228942871094},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.49163156747817993},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4889880418777466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4657227694988251},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.4588736593723297},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.438017874956131},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4247596263885498},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.41631200909614563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40661343932151794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37680453062057495},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3221741318702698},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2714523673057556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22436565160751343},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07005113363265991},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exaa007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exaa007","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W4211966","https://openalex.org/W191942163","https://openalex.org/W1493925387","https://openalex.org/W1525645762","https://openalex.org/W1563654733","https://openalex.org/W1584587517","https://openalex.org/W1920190523","https://openalex.org/W1969367179","https://openalex.org/W1978277837","https://openalex.org/W1978809935","https://openalex.org/W1979801752","https://openalex.org/W2000920814","https://openalex.org/W2005214236","https://openalex.org/W2012857639","https://openalex.org/W2015619699","https://openalex.org/W2026191634","https://openalex.org/W2032001066","https://openalex.org/W2088432971","https://openalex.org/W2091565038","https://openalex.org/W2093023104","https://openalex.org/W2111158824","https://openalex.org/W2138597883","https://openalex.org/W2159341052","https://openalex.org/W2218994104","https://openalex.org/W2293632979","https://openalex.org/W2406565089","https://openalex.org/W2798603509","https://openalex.org/W2963175946","https://openalex.org/W3103882277","https://openalex.org/W4212875940","https://openalex.org/W4241108585","https://openalex.org/W4241604193","https://openalex.org/W6600166691","https://openalex.org/W6607875812","https://openalex.org/W6629354890","https://openalex.org/W6631394935","https://openalex.org/W6656927764","https://openalex.org/W6683350426","https://openalex.org/W6688805415","https://openalex.org/W6696977267","https://openalex.org/W6714301515","https://openalex.org/W6750567401","https://openalex.org/W6764129436","https://openalex.org/W6822517396"],"related_works":["https://openalex.org/W3094951835","https://openalex.org/W2964237202","https://openalex.org/W1988772559","https://openalex.org/W2029183607","https://openalex.org/W2555446247","https://openalex.org/W2079745007","https://openalex.org/W2743728300","https://openalex.org/W1504200807","https://openalex.org/W4309066665","https://openalex.org/W3007499230"],"abstract_inverted_index":{"Abstract":[0],"This":[1,154],"paper":[2,39],"studies":[3],"the":[4,17,27,37,49,87,135,143,148,174],"complexity":[5,31,52,146],"of":[6,8,19,29,40,53,107,113,127,147,160],"languages":[7,55,60,126],"finite":[9],"words":[10],"using":[11],"automata":[12,25,73],"theory.":[13],"To":[14],"go":[15],"beyond":[16],"class":[18],"regular":[20],"languages,":[21,108],"we":[22,47],"consider":[23],"infinite":[24],"and":[26,56,79,89,109,134,162],"notion":[28],"state":[30,51,66,132,145],"defined":[32],"by":[33,36,76],"Karp.":[34],"Motivated":[35],"seminal":[38],"Rabin":[41],"from":[42,164],"1963":[43],"introducing":[44],"probabilistic":[45,54,59],"automata,":[46],"study":[48],"(deterministic)":[50],"prove":[57],"that":[58,123],"can":[61],"have":[62],"arbitrarily":[63,128],"high":[64,129],"deterministic":[65],"complexity.":[67],"We":[68,96],"then":[69],"look":[70],"at":[71],"alternating":[72,131,144],"as":[74],"introduced":[75],"Chandra,":[77],"Kozen":[78],"Stockmeyer:":[80],"such":[81],"machines":[82],"run":[83],"independent":[84],"computations":[85],"on":[86,103,142],"word":[88],"gather":[90],"their":[91],"answers":[92],"through":[93],"boolean":[94],"combinations.":[95],"devise":[97],"a":[98,119,138,158],"lower":[99,140,171],"bound":[100,141,172],"technique":[101],"relying":[102],"boundedly":[104],"generated":[105],"lattices":[106],"give":[110],"two":[111],"applications":[112],"this":[114],"technique.":[115],"The":[116],"first":[117],"is":[118,137],"hierarchy":[120],"theorem,":[121],"stating":[122],"there":[124],"are":[125],"polynomial":[130],"complexity,":[133],"second":[136,155],"linear":[139],"prime":[149],"numbers":[150],"written":[151],"in":[152],"binary.":[153],"result":[156,159],"strengthens":[157],"Hartmanis":[161],"Shank":[163],"1968,":[165],"which":[166],"implies":[167],"an":[168],"exponentially":[169],"worse":[170],"for":[173],"same":[175],"model.":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}