{"id":"https://openalex.org/W2093102658","doi":"https://doi.org/10.1007/s00165-006-0005-4","title":"An approximation algorithm for state minimization in 2-MDFAs","display_name":"An approximation algorithm for state minimization in 2-MDFAs","publication_year":2006,"publication_date":"2006-08-07","ids":{"openalex":"https://openalex.org/W2093102658","doi":"https://doi.org/10.1007/s00165-006-0005-4","mag":"2093102658"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-006-0005-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-006-0005-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-006-0005-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-006-0005-4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Subramani","raw_affiliation_strings":["Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087565379","display_name":"C. Tauras","orcid":null},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Tauras","raw_affiliation_strings":["Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lane Department of Computer Science and Electrical Engineering, West Virginia University, 26506, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.152777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"4","first_page":"421","last_page":"431"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9955000281333923,"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.6294487714767456},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5977899432182312},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5511398911476135},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5496392250061035},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5353681445121765},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5137301683425903},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.49948811531066895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4728577136993408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4409419894218445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3755950927734375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3284303545951843},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.32717058062553406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25195297598838806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13242271542549133}],"concepts":[{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.6294487714767456},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5977899432182312},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5511398911476135},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5496392250061035},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5353681445121765},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5137301683425903},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.49948811531066895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4728577136993408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4409419894218445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3755950927734375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3284303545951843},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.32717058062553406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25195297598838806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13242271542549133}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00165-006-0005-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-006-0005-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-006-0005-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00165-006-0005-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-006-0005-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-006-0005-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.75,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321409","display_name":"Aalborg Universitet","ror":"https://ror.org/04m5j1k67"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2093102658.pdf","grobid_xml":"https://content.openalex.org/works/W2093102658.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W1505262931","https://openalex.org/W1547106396","https://openalex.org/W1964127120","https://openalex.org/W1975246937","https://openalex.org/W1990313671","https://openalex.org/W2002089154","https://openalex.org/W2006629323","https://openalex.org/W2024380444","https://openalex.org/W2063230375","https://openalex.org/W2090921231","https://openalex.org/W2752885492","https://openalex.org/W4231393247"],"related_works":["https://openalex.org/W2100711766","https://openalex.org/W2019603173","https://openalex.org/W2030569822","https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W1975910189","https://openalex.org/W1510709958","https://openalex.org/W2950563206","https://openalex.org/W2024421699","https://openalex.org/W4210940113"],"abstract_inverted_index":{"Abstract":[0],"In":[1,116],"this":[2,271],"paper,":[3,234],"we":[4],"analyze":[5],"the":[6,107,131,143,176,190,194,209,222,232,236,251,259],"problem":[7,134,196,212,225],"of":[8,14,99,109,118,142,175,192,238,254],"state":[9,35,45,83,110,124,132,223,244],"minimization":[10,111,133,195,224,245],"in":[11,38,57,140,173,189,201,226,231,246],"a":[12,32,41,55,69,77,85,96,113,263,268],"class":[13],"Finite":[15,23],"State":[16,21,24],"Automata":[17,25],"called":[18],"Two":[19],"Start":[20],"Deterministic":[22],"(2-MDFAs).":[26],"A":[27,64],"2-MDFA":[28,70],"is":[29,66,112,128,135,213,235,273],"similar":[30],"to":[31,84,257],"deterministic":[33],"finite":[34,123],"automaton":[36],"(DFA),":[37],"that":[39,58,89,93,130,160,208,270],"on":[40,88,147,180,217],"given":[42],"input,":[43],"each":[44],"has":[46],"precisely":[47],"one":[48],"destination":[49],"state;":[50],"however,":[51],"it":[52,127],"differs":[53],"from":[54,80,106],"DFA":[56],"there":[59,75],"are":[60],"two":[61],"start":[62,82],"states.":[63],"string":[65,90],"accepted":[67],"by":[68],"if":[71,74],"and":[72,101,138,150,158,171,182],"only":[73],"exists":[76],"transitional":[78],"path":[79],"either":[81],"finish":[86],"state,":[87],".":[91],"Observe":[92],"2-MDFAs":[94],"provide":[95],"limited":[97],"amount":[98],"non-determinism":[100],"hence":[102],"investigating":[103],"their":[104],"properties":[105],"perspective":[108],"worthwhile":[114],"pursuit.":[115],"case":[117,191],"unbounded":[119],"non-determinism,":[120],"i.e.,":[121],"Non-deterministic":[122],"automata":[125,162,183],"(NFAs),":[126],"well-known":[129],"PSPACE-complete":[136],"[Jiang":[137],"Ravikumar":[139],"Proceedings":[141,174],"18th":[144],"International":[145],"Colloquium":[146],"Automata,":[148],"Languages":[149],"Programming,":[151],"ICALP\u201991,":[152],"Madrid,":[153],"Spain,":[154],"July":[155],"8\u201312,":[156],"1991]":[157],"further":[159],"such":[161],"can":[163],"be":[164],"exponentially":[165],"more":[166],"succinct":[167],"than":[168],"DFAs":[169],"[Meyer":[170],"Fischer":[172],"12th":[177],"SWAT(Annual":[178],"Symposium":[179],"switching":[181],"theory),":[184],"pp":[185],"188-191,":[186],"1971].":[187],"Even":[188],"2-MDFAs,":[193,247],"remains":[197],"non-trivial;":[198],"indeed,":[199],"Malcher":[200],"Theor":[202],"Comput":[203],"Sci":[204],"327(3):375\u2013390,":[205],"2004":[206],"shows":[207],"corresponding":[210],"decision":[211],"NP-complete.":[214],"We":[215,265],"focus":[216],"deriving":[218],"approximability":[219],"bounds":[220],"for":[221,243,275],"2-MDFAs.":[227],"Our":[228],"main":[229],"contribution":[230],"current":[233],"design":[237],"an":[239],"n":[240,249],"-approximation":[241],"algorithm":[242],"where":[248],"denotes":[250],"minimum":[252],"number":[253],"states":[255],"required":[256],"represent":[258],"input":[260],"language":[261],"as":[262],"2-MDFA.":[264],"also":[266],"present":[267],"proof":[269],"bound":[272],"tight":[274],"our":[276],"algorithm.":[277]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}