{"id":"https://openalex.org/W2113629662","doi":"https://doi.org/10.1142/s0129054113500330","title":"PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA","display_name":"PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2113629662","doi":"https://doi.org/10.1142/s0129054113500330","mag":"2113629662"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500330","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500330","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/A5040523230","display_name":"Hermann Gruber","orcid":"https://orcid.org/0000-0002-1953-3697"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HERMANN GRUBER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, D-35392, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, D-35392, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MARKUS HOLZER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, D-35392, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse 2, D-35392, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.729,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74644898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"08","first_page":"1255","last_page":"1279"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9970999956130981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9962000250816345,"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/regular-expression","display_name":"Regular expression","score":0.7920913100242615},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.7421112060546875},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7251100540161133},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6791067719459534},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.6678246259689331},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6491352319717407},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.625450849533081},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5818860530853271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5552131533622742},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5261585116386414},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5239389538764954},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4927249252796173},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48175930976867676},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.4453844428062439},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4439460039138794},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41265174746513367},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.3719075322151184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2858506441116333},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2742631137371063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23974809050559998},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20687025785446167},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09748202562332153}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7920913100242615},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.7421112060546875},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7251100540161133},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6791067719459534},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.6678246259689331},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6491352319717407},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.625450849533081},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5818860530853271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552131533622742},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5261585116386414},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5239389538764954},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4927249252796173},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48175930976867676},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.4453844428062439},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4439460039138794},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41265174746513367},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.3719075322151184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2858506441116333},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2742631137371063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23974809050559998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20687025785446167},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09748202562332153},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113500330","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500330","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1481305961","https://openalex.org/W1485181793","https://openalex.org/W1508355880","https://openalex.org/W1539025858","https://openalex.org/W1545666019","https://openalex.org/W1570445666","https://openalex.org/W1570949334","https://openalex.org/W1595778895","https://openalex.org/W1948341970","https://openalex.org/W1986058515","https://openalex.org/W1987660690","https://openalex.org/W1991755800","https://openalex.org/W1998084650","https://openalex.org/W2002089154","https://openalex.org/W2002722727","https://openalex.org/W2008440715","https://openalex.org/W2027562075","https://openalex.org/W2035485003","https://openalex.org/W2038643780","https://openalex.org/W2039985220","https://openalex.org/W2052210031","https://openalex.org/W2066064214","https://openalex.org/W2076164610","https://openalex.org/W2082135413","https://openalex.org/W2083101699","https://openalex.org/W2129414328","https://openalex.org/W2142662777","https://openalex.org/W2156429182","https://openalex.org/W2168320078","https://openalex.org/W2462139357","https://openalex.org/W2475482660","https://openalex.org/W2912608078","https://openalex.org/W2913683243"],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W2368684504","https://openalex.org/W1975910189","https://openalex.org/W2160879187","https://openalex.org/W3143588635","https://openalex.org/W1530258609","https://openalex.org/W2125008689","https://openalex.org/W2256485807","https://openalex.org/W1423874546"],"abstract_inverted_index":{"Based":[0],"on":[1,39,46],"recent":[2],"results":[3],"from":[4],"extremal":[5],"graph":[6],"theory,":[7],"we":[8,34],"prove":[9],"that":[10],"every":[11],"n-state":[12],"binary":[13],"deterministic":[14],"finite":[15],"automaton":[16],"can":[17],"be":[18],"converted":[19],"into":[20],"an":[21],"equivalent":[22],"regular":[23,47],"expression":[24],"of":[25],"size":[26],"O(1.742":[27],"n":[28],")":[29],"using":[30],"state":[31],"elimination.":[32],"Furthermore,":[33],"give":[35],"improved":[36],"upper":[37],"bounds":[38],"the":[40],"language":[41],"operations":[42],"intersection":[43],"and":[44],"interleaving":[45],"expressions.":[48]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}