{"id":"https://openalex.org/W6908057288","doi":"https://doi.org/10.25596/jalc-2023-121","title":"State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages","display_name":"State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6908057288","doi":"https://doi.org/10.25596/jalc-2023-121"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2023-121","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2023-121","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"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.25596/jalc-2023-121","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Okhotin, Alexander","orcid":"https://orcid.org/0000-0002-1615-2725"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Okhotin, Alexander","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1615-2725","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sazhneva, Elizaveta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sazhneva, Elizaveta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26100312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9764000177383423,"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.9764000177383423,"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.0066999997943639755,"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.002400000113993883,"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/state","display_name":"State (computer science)","score":0.6061999797821045},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5573999881744385},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.5012000203132629},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4787999987602234},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4275999963283539},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.4214000105857849},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4162999987602234}],"concepts":[{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.6061999797821045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5938000082969666},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5573999881744385},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.5012000203132629},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4787999987602234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4494999945163727},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4162999987602234},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.414900004863739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4124999940395355},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.4066999852657318},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36980000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34619998931884766},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C16671368","wikidata":"https://www.wikidata.org/wiki/Q230885","display_name":"State diagram","level":3,"score":0.32429999113082886},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.30399999022483826},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.29409998655319214},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2023-121","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2023-121","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"}],"best_oa_location":{"id":"doi:10.25596/jalc-2023-121","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2023-121","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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.49869638681411743}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"GF(2)-inverse":[1],"operation":[2],"on":[3],"formal":[4],"languages,":[5],"defined":[6],"for":[7,24,33,44,76],"every":[8,67],"language":[9],"containing":[10],"the":[11,61],"empty":[12],"string,":[13],"is":[14,22,41,51,64,70],"known":[15],"to":[16,66],"preserve":[17],"regularity;":[18],"its":[19,48,73],"state":[20,49,74],"complexity":[21,50,75],"$2^n+1$":[23],"alphabets":[25],"with":[26],"at":[27],"least":[28],"three":[29],"symbols,":[30],"and":[31],"$2^{n-1}+1$":[32],"a":[34,45,57,77],"one-symbol":[35],"alphabet.":[36],"In":[37],"this":[38],"paper,":[39],"it":[40,69],"proved":[42,71],"that,":[43],"two-symbol":[46],"alphabet,":[47],"exactly":[52],"$\\frac{3}{4}2^n":[53],"+":[54],"3$.":[55],"For":[56],"more":[58],"general":[59],"operation,":[60],"GF(2)-star,":[62],"which":[63],"applicable":[65],"language,":[68],"that":[72],"binary":[78],"alphabet":[79],"remains~$2^n+1$.":[80]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}