{"id":"https://openalex.org/W2094242422","doi":"https://doi.org/10.1142/s0129054113400200","title":"HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA","display_name":"HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2094242422","doi":"https://doi.org/10.1142/s0129054113400200","mag":"2094242422"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400200","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400200","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/A5066525178","display_name":"Artur Je\u017c","orcid":"https://orcid.org/0000-0003-4321-3105"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"ARTUR JE\u017b","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087927480","display_name":"Andreas Maletti","orcid":"https://orcid.org/0000-0003-3202-0498"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ANDREAS MALETTI","raw_affiliation_strings":["Institute for Natural Language Processing, Universit\u00e4t Stuttgart Pfaffenwaldring 5b, 70569 Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Natural Language Processing, Universit\u00e4t Stuttgart Pfaffenwaldring 5b, 70569 Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066525178"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":1.1096,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79869021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"06","first_page":"815","last_page":"830"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9975000023841858,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9958999752998352,"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/dfa-minimization","display_name":"DFA minimization","score":0.7503930330276489},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.7164186239242554},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6296329498291016},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6199443936347961},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.602139949798584},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5779897570610046},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5768136382102966},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.5737119913101196},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.56360924243927},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.519848644733429},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5022921562194824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5019576549530029},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46659019589424133},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4653604328632355},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.42786332964897156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42101335525512695},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3827381134033203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34823077917099},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28072303533554077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22061008214950562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15553298592567444}],"concepts":[{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.7503930330276489},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.7164186239242554},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6296329498291016},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6199443936347961},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.602139949798584},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5779897570610046},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5768136382102966},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.5737119913101196},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.56360924243927},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.519848644733429},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5022921562194824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5019576549530029},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46659019589424133},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4653604328632355},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.42786332964897156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42101335525512695},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3827381134033203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34823077917099},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28072303533554077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22061008214950562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15553298592567444}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s0129054113400200","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400200","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.391.3951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.391.3951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ims.uni-stuttgart.de/institut/mitarbeiter/maletti/pub/jezmal12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.4196","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.4196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ims.uni-stuttgart.de/institut/mitarbeiter/maletti/pub/jezmal12b.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.4829","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.4829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ims.uni-stuttgart.de/institut/mitarbeiter/maletti/pub/slides/2012-07-17.pdf","raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:1922481","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0015-3F54-B","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1876458857","https://openalex.org/W1989148126","https://openalex.org/W2063531020","https://openalex.org/W2089409100","https://openalex.org/W2090431024","https://openalex.org/W2111868903","https://openalex.org/W2118382442","https://openalex.org/W2125529971","https://openalex.org/W2132629030","https://openalex.org/W4211010176","https://openalex.org/W4211152277"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2037872771","https://openalex.org/W220670778","https://openalex.org/W2368684504","https://openalex.org/W1825821945","https://openalex.org/W63685668","https://openalex.org/W2243509623","https://openalex.org/W11319064","https://openalex.org/W1482505495","https://openalex.org/W2142413136"],"abstract_inverted_index":{"Hyper-minimization":[0],"is":[1,26,42,56,87,96],"a":[2,30],"recent":[3],"automaton":[4,14],"compression":[5,24],"technique":[6],"that":[7],"can":[8],"reduce":[9],"the":[10,16,34,59,88,91,97,102],"size":[11,89],"of":[12,90,99,101],"an":[13],"beyond":[15],"limits":[17],"imposed":[18],"by":[19,28],"classical":[20],"minimization.":[21],"The":[22,37,49,72],"additional":[23],"power":[25],"enabled":[27],"allowing":[29],"finite":[31],"difference":[32],"in":[33,76,80],"represented":[35],"language.":[36],"necessary":[38],"theory":[39],"for":[40,44,52,62,67],"hyper-minimization":[41,50,60],"developed":[43],"(bottom-up)":[45],"deterministic":[46,53,63],"tree":[47,54,104],"automata.":[48],"problem":[51,61],"automata":[55],"reduced":[57],"to":[58],"finite-state":[64],"string":[65],"automata,":[66],"which":[68],"fast":[69],"algorithms":[70],"exist.":[71],"fastest":[73],"algorithm":[74],"obtained":[75],"this":[77],"way":[78],"runs":[79],"time":[81],"[Formula:":[82],"see":[83],"text],":[84],"where":[85],"m":[86],"transition":[92],"table":[93],"and":[94],"n":[95],"number":[98],"states":[100],"input":[103],"automaton.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}