Bit parallelism -- NFA simulation

DOI10.1007/3-540-36390-4_13MaRDI QIDQ4412576zbMATH OpenFDO

Authors Jan Holub

Publication date 15 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2494/24940149.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Dynamic programming -- NFA simulation
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• On Parallel Implementations of Deterministic Finite Automata
• A New Approach to Determinisation Using Bit-Parallelism

Cited in

(6)

• Bit copying: the ultimate computational simplicity
• The finite automata approaches in stringology
• A New Approach to Determinisation Using Bit-Parallelism
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• Dynamic programming -- NFA simulation
• scientific article; zbMATH DE number 2201363 (Why is no real title available?)

This page was built for publication: Bit parallelism -- NFA simulation

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