Multi-entry DFA with reduced initial states to speedup parallel recognition

DOI10.1007/978-3-032-02602-6_5MaRDI QIDQ6861695zbMATH OpenFDO

Authors Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_5

zbMATH Keywords

regular languagefinite automataparallel recognitionmulti-core computer architecturemulti-entry DFAspeculation overhead

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 1502109 (Why is no real title available?)
• scientific article; zbMATH DE number 1747444 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• A note on multiple-entry finite automata
• Aggregation-based minimization of finite state automata
• Finite nondeterminism versus DFAs with multiple initial states
• From regular expressions to smaller NFAs
• Incremental NFA minimization
• Minimizing nfa's and regular expressions
• Morphisms and Minimisation of Weighted Automata
• Multiple-entry finite automata
• On Parallel Implementations of Deterministic Finite Automata
• Parallel Prefix Computation
• Some remarks on multiple-entry finite automata

This page was built for publication: Multi-entry DFA with reduced initial states to speedup parallel recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861695)