An Evaluation of Massively Parallel Algorithms for DFA Minimization

Saved in:
Bibliographic Details
Published in:Electronic proceedings in theoretical computer science 2024-10, Vol.409, p.138-153
Main Authors: Martens, Jan, Wijs, Anton
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c160t-804b853c08e50daafe4bc9a6c3b4527b84013c72e296c25ca836674ea9fa76ec3
container_end_page 153
container_issue
container_start_page 138
container_title Electronic proceedings in theoretical computer science
container_volume 409
creator Martens, Jan
Wijs, Anton
description
doi_str_mv 10.4204/EPTCS.409.13
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_4204_EPTCS_409_13</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_4204_EPTCS_409_13</sourcerecordid><originalsourceid>FETCH-LOGICAL-c160t-804b853c08e50daafe4bc9a6c3b4527b84013c72e296c25ca836674ea9fa76ec3</originalsourceid><addsrcrecordid>eNpNkE1OwzAYRC0EElXpjgP4ACT4L068jEJKkVpRibK2vhgbjJwE2aFSOT2lsGA2M5s3i4fQNSW5YETctttd85QLonLKz9CMkbLIGK3I-b99iRYpvZNjuGJCyRlq6gG3ewifMPlxwKPDG0jJ72044C1ECMEGXIfXMfrprU_YjRHfLWu88YPv_deJukIXDkKyi7-eo-dlu2tW2frx_qGp15mhkkxZRURXFdyQyhbkBcBZ0RkF0vBOFKzsKkEoNyWzTEnDCgMVl7IUFpSDUlrD5-jm99fEMaVonf6Ivod40JToHwf65EAfHWjK-TdtwU6m</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An Evaluation of Massively Parallel Algorithms for DFA Minimization</title><source>ROAD: Directory of Open Access Scholarly Resources</source><creator>Martens, Jan ; Wijs, Anton</creator><creatorcontrib>Martens, Jan ; Wijs, Anton</creatorcontrib><identifier>ISSN: 2075-2180</identifier><identifier>EISSN: 2075-2180</identifier><identifier>DOI: 10.4204/EPTCS.409.13</identifier><language>eng</language><ispartof>Electronic proceedings in theoretical computer science, 2024-10, Vol.409, p.138-153</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c160t-804b853c08e50daafe4bc9a6c3b4527b84013c72e296c25ca836674ea9fa76ec3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Martens, Jan</creatorcontrib><creatorcontrib>Wijs, Anton</creatorcontrib><title>An Evaluation of Massively Parallel Algorithms for DFA Minimization</title><title>Electronic proceedings in theoretical computer science</title><issn>2075-2180</issn><issn>2075-2180</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNpNkE1OwzAYRC0EElXpjgP4ACT4L068jEJKkVpRibK2vhgbjJwE2aFSOT2lsGA2M5s3i4fQNSW5YETctttd85QLonLKz9CMkbLIGK3I-b99iRYpvZNjuGJCyRlq6gG3ewifMPlxwKPDG0jJ72044C1ECMEGXIfXMfrprU_YjRHfLWu88YPv_deJukIXDkKyi7-eo-dlu2tW2frx_qGp15mhkkxZRURXFdyQyhbkBcBZ0RkF0vBOFKzsKkEoNyWzTEnDCgMVl7IUFpSDUlrD5-jm99fEMaVonf6Ivod40JToHwf65EAfHWjK-TdtwU6m</recordid><startdate>20241030</startdate><enddate>20241030</enddate><creator>Martens, Jan</creator><creator>Wijs, Anton</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20241030</creationdate><title>An Evaluation of Massively Parallel Algorithms for DFA Minimization</title><author>Martens, Jan ; Wijs, Anton</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c160t-804b853c08e50daafe4bc9a6c3b4527b84013c72e296c25ca836674ea9fa76ec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Martens, Jan</creatorcontrib><creatorcontrib>Wijs, Anton</creatorcontrib><collection>CrossRef</collection><jtitle>Electronic proceedings in theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Martens, Jan</au><au>Wijs, Anton</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Evaluation of Massively Parallel Algorithms for DFA Minimization</atitle><jtitle>Electronic proceedings in theoretical computer science</jtitle><date>2024-10-30</date><risdate>2024</risdate><volume>409</volume><spage>138</spage><epage>153</epage><pages>138-153</pages><issn>2075-2180</issn><eissn>2075-2180</eissn><doi>10.4204/EPTCS.409.13</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2075-2180
ispartof Electronic proceedings in theoretical computer science, 2024-10, Vol.409, p.138-153
issn 2075-2180
2075-2180
language eng
recordid cdi_crossref_primary_10_4204_EPTCS_409_13
source ROAD: Directory of Open Access Scholarly Resources
title An Evaluation of Massively Parallel Algorithms for DFA Minimization
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T01%3A31%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Evaluation%20of%20Massively%20Parallel%20Algorithms%20for%20DFA%20Minimization&rft.jtitle=Electronic%20proceedings%20in%20theoretical%20computer%20science&rft.au=Martens,%20Jan&rft.date=2024-10-30&rft.volume=409&rft.spage=138&rft.epage=153&rft.pages=138-153&rft.issn=2075-2180&rft.eissn=2075-2180&rft_id=info:doi/10.4204/EPTCS.409.13&rft_dat=%3Ccrossref%3E10_4204_EPTCS_409_13%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c160t-804b853c08e50daafe4bc9a6c3b4527b84013c72e296c25ca836674ea9fa76ec3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true