On Parallel Implementations of Deterministic Finite Automata

DOI10.1007/978-3-642-02979-0_9zbMATH Open1248.68300OpenAlexW1525776788MaRDI QIDQ3637342FDOQ3637342

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1419219
• Parallelization of automata
• The parallel complexity of finite-state automata problems
• Parallel decision procedures for finite state automata
• On the Computational Capacity of Parallel Communicating Finite Automata
• On the computational capacity of parallel communicating finite automata
• scientific article; zbMATH DE number 3890738
• On the parallelizability of languages accepted by P automata
• Parallel algorithms for minimal nondeterministic finite automata inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Parallel Prefix Computation
• Programming Techniques: Regular expression search algorithm
• Distributed pattern matching using finite automata
• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS

Cited In (15)

• Parallel decision procedures for finite state automata
• Title not available (Why is that?)
• Distributed pattern matching using finite automata
• On the Computational Capacity of Parallel Communicating Finite Automata
• Branching automata with costs -- a way of reflecting parallelism in costs
• A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner
• On the computational capacity of parallel communicating finite automata
• Title not available (Why is that?)
• Efficient divide-and-conquer implementations of symmetric FSAs
• Runtime verification with minimal intrusion through parallelism
• Title not available (Why is that?)
• Speedups of deterministic machines by synchronous parallel machines
• A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton
• Synchronizing series-parallel deterministic finite automata with loops and related problems
• On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching

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

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