{"id":"https://openalex.org/W2109227159","doi":"https://doi.org/10.1109/ipps.1996.508056","title":"A parallel algorithm for minimization of finite automata","display_name":"A parallel algorithm for minimization of finite automata","publication_year":2002,"publication_date":"2002-12-23","ids":{"openalex":"https://openalex.org/W2109227159","doi":"https://doi.org/10.1109/ipps.1996.508056","mag":"2109227159"},"language":"en","primary_location":{"id":"doi:10.1109/ipps.1996.508056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1996.508056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of International Conference on Parallel Processing","raw_type":"proceedings-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/A5065615032","display_name":"Bala Ravikumar","orcid":null},"institutions":[{"id":"https://openalex.org/I17626003","display_name":"University of Rhode Island","ror":"https://ror.org/013ckk937","country_code":"US","type":"education","lineage":["https://openalex.org/I17626003"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Ravikumar","raw_affiliation_strings":["Department of Computer Science, University of Rhode Island, Kingston, RI, USA","Dept. of Comput. Sci., Rhode Island Univ., Kingston, RI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rhode Island, Kingston, RI, USA","institution_ids":["https://openalex.org/I17626003"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rhode Island Univ., Kingston, RI, USA","institution_ids":["https://openalex.org/I17626003"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109219709","display_name":"X. Xiong","orcid":null},"institutions":[{"id":"https://openalex.org/I17626003","display_name":"University of Rhode Island","ror":"https://ror.org/013ckk937","country_code":"US","type":"education","lineage":["https://openalex.org/I17626003"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"X. Xiong","raw_affiliation_strings":["Department of Computer Science, University of Rhode Island, Kingston, RI, USA","Dept. of Comput. Sci., Rhode Island Univ., Kingston, RI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rhode Island, Kingston, RI, USA","institution_ids":["https://openalex.org/I17626003"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rhode Island Univ., Kingston, RI, USA","institution_ids":["https://openalex.org/I17626003"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065615032"],"corresponding_institution_ids":["https://openalex.org/I17626003"],"apc_list":null,"apc_paid":null,"fwci":0.4261,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.69895022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"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/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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.6799358129501343},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.6313459873199463},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6229609847068787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.601616621017456},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5919837951660156},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5878061056137085},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5438523888587952},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4724845290184021},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4468221068382263},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4274333715438843},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4243777394294739},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3567700982093811},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35309940576553345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30821508169174194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2732763886451721}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6799358129501343},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.6313459873199463},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6229609847068787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.601616621017456},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5919837951660156},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5878061056137085},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5438523888587952},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4724845290184021},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4468221068382263},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4274333715438843},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4243777394294739},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3567700982093811},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35309940576553345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30821508169174194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2732763886451721},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipps.1996.508056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1996.508056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.4123","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.4123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepage.cs.uri.edu/faculty/ravikumar/mindfa.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320431","display_name":"Australian National University","ror":"https://ror.org/019wvm592"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W152433294","https://openalex.org/W1489273657","https://openalex.org/W1521993263","https://openalex.org/W1538240903","https://openalex.org/W1545666019","https://openalex.org/W1978062186","https://openalex.org/W2000862829","https://openalex.org/W2002089154","https://openalex.org/W2007293413","https://openalex.org/W2030681981","https://openalex.org/W2033214895","https://openalex.org/W2045291344","https://openalex.org/W2050046996","https://openalex.org/W2089904802","https://openalex.org/W2090195984","https://openalex.org/W2105487688","https://openalex.org/W2120490947","https://openalex.org/W2122493035","https://openalex.org/W2437273925","https://openalex.org/W2493256084","https://openalex.org/W3177082579","https://openalex.org/W4300123403","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2355522437","https://openalex.org/W1428391281","https://openalex.org/W2111868903","https://openalex.org/W4281261571","https://openalex.org/W3087272834","https://openalex.org/W2280116234","https://openalex.org/W2384360959","https://openalex.org/W2100711766","https://openalex.org/W4252918107","https://openalex.org/W2019603173"],"abstract_inverted_index":{"We":[0,30,122],"present":[1],"a":[2,19,37,71],"parallel":[3,25,107],"algorithm":[4,67,87],"for":[5,44,112],"the":[6,77,91,116,124,128],"minimization":[7],"of":[8,46,73,76,98],"deterministic":[9],"finite":[10],"state":[11],"automata":[12],"(DFAs)":[13],"and":[14,26,127],"discuss":[15,123],"its":[16,33],"implementation":[17,125],"on":[18,36,58],"connection":[20],"machine":[21],"CM-5":[22],"using":[23],"data":[24],"message":[27],"passing":[28],"models.":[29],"show":[31],"that":[32],"time":[34],"complexity":[35],"p":[38],"processor":[39],"EREW":[40],"PRAM":[41],"(p/spl":[42],"les/n)":[43],"inputs":[45],"size":[47],"n":[48,54],"is":[49,68,88],"O([n":[50],"log/sup":[51],"2/":[52],"n/p]+log":[53],"log":[55],"p)":[56],"uniformly":[57],"almost":[59],"all":[60],"instances.":[61],"The":[62,82,94],"work":[63],"done":[64],"by":[65,85],"our":[66,86,99],"thus":[69],"within":[70],"factor":[72],"O(log":[74],"n)":[75],"best":[78],"known":[79],"sequential":[80],"algorithm.":[81],"space":[83],"used":[84],"linear":[89],"in":[90,115],"input":[92],"size.":[93],"actual":[95],"resource":[96],"requirements":[97],"implementations":[100],"are":[101,119],"consistent":[102],"with":[103],"these":[104],"estimates.":[105],"Although":[106],"algorithms":[108],"have":[109],"been":[110],"proposed":[111],"this":[113],"problem":[114],"past,":[117],"they":[118],"not":[120],"practical.":[121],"details":[126],"experimental":[129],"results.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}