{"id":"https://openalex.org/W1589654709","doi":"https://doi.org/10.25596/jalc-2004-365","title":"State Complexity of Linear Conjunctive Languages","display_name":"State Complexity of Linear Conjunctive Languages","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1589654709","doi":"https://doi.org/10.25596/jalc-2004-365","mag":"1589654709"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.7695","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7695","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hirvi.cs.queensu.ca/conjunctive/linear_state_complexity.ps","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.25596/jalc-2004-365","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005683089","display_name":"Alexander Okhotin","orcid":"https://orcid.org/0000-0002-1615-2725"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Okhotin, Alexander","raw_affiliation_strings":["School of Computing, Queen's University Kingston Ontario Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Queen's University Kingston Ontario Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005683089"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0827554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"256","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9959999918937683,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9918000102043152,"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/succinctness","display_name":"Succinctness","score":0.8424345850944519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5828043222427368},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5693225860595703},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.48346930742263794},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.47136250138282776},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4415963590145111},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.42667990922927856},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42401552200317383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35175132751464844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.328537255525589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2985990047454834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2453656792640686},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.2249070107936859},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.2095944881439209},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08585235476493835}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.8424345850944519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5828043222427368},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5693225860595703},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.48346930742263794},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.47136250138282776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4415963590145111},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.42667990922927856},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42401552200317383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35175132751464844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.328537255525589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2985990047454834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2453656792640686},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.2249070107936859},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.2095944881439209},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08585235476493835},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.7695","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7695","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hirvi.cs.queensu.ca/conjunctive/linear_state_complexity.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.246","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hirvi.cs.queensu.ca/conjunctive/linear_state_complexity_dcfs.ps","raw_type":"text"},{"id":"doi:10.25596/jalc-2004-365","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:1589654709","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dcfs/dcfs2002.html#Okhotin02","pdf_url":null,"source":{"id":"https://openalex.org/S4306507593","display_name":"DCFS","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"DCFS","raw_type":null},{"id":"mag:2400907287","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc9.html#Okhotin04","pdf_url":null,"source":{"id":"https://openalex.org/S4306418178","display_name":"Descriptional Complexity of Formal Systems","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Descriptional Complexity of Formal Systems","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2004-365","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1966469270","https://openalex.org/W1547232601","https://openalex.org/W2011252827","https://openalex.org/W2982732377","https://openalex.org/W3102867119","https://openalex.org/W3150719485","https://openalex.org/W2133749858","https://openalex.org/W2182424838","https://openalex.org/W2295913986","https://openalex.org/W2963524373","https://openalex.org/W2050612755","https://openalex.org/W1878133323","https://openalex.org/W1562206651","https://openalex.org/W2583206604","https://openalex.org/W2885898631","https://openalex.org/W2188133862","https://openalex.org/W2111569703","https://openalex.org/W2057747677","https://openalex.org/W2294377302","https://openalex.org/W2952990304"],"abstract_inverted_index":{"The":[0,47],"e-free":[1],"languages":[2,16,52],"generated":[3],"by":[4,18,34],"linear":[5,101],"conjunctive":[6,102],"grammars":[7,103],"have":[8],"recently":[9],"been":[10],"proved":[11],"to":[12,68,81],"be":[13],"exactly":[14],"the":[15,24,27,36,43,51,73,82,97],"accepted":[17],"trellis":[19,105],"automata.":[20,86],"This":[21],"paper":[22],"begins":[23],"study":[25],"of":[26,30,38,45,50,76,84],"descriptional":[28],"complexity":[29,49,75],"this":[31],"language":[32],"family":[33],"comparing":[35],"number":[37],"states":[39],"in":[40],"automata":[41,106],"with":[42],"size":[44],"grammars.":[46],"state":[48],"$(a^C)^+$":[53],"and":[54,64,80,91,104],"$\\{a^n(b^C^n)^+":[55],"|":[56],"n\\geq":[57],"1\\}$":[58],"is":[59,62],"determined":[60],"(it":[61],"$C$":[63],"$C+3$,":[65],"respectively),":[66],"leading":[67],"an":[69,92],"exact":[70],"expression":[71],"for":[72,96],"worst-case":[74],"all":[77],"set-theoretic":[78],"operations":[79],"non-uniqueness":[83],"minimal":[85],"A":[87],"superpolynomial":[88],"lower":[89],"bound":[90,95],"exponential":[93],"upper":[94],"succinctness":[98],"tradeoff":[99],"between":[100],"are":[107],"established.":[108]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}