On Parallel Implementations of Deterministic Finite Automata

DOI10.1007/978-3-642-02979-0_9zbMath1248.68300OpenAlexW1525776788MaRDI QIDQ3637342

Jan Holub, Stanislav Štekr

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Runtime verification with minimal intrusion through parallelism ⋮ On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching

Cites Work

• Unnamed Item
• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS
• Parallel Prefix Computation
• Programming Techniques: Regular expression search algorithm

This page was built for publication: On Parallel Implementations of Deterministic Finite Automata