Distributed pattern matching using finite automata

MaRDI QIDQ2731277zbMATH OpenFDO

Authors Jan Holub, Costas S. Iliopoulos, L. Mouchard, Bořivoj Melichar

Publication date 29 July 2001

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distributed pattern matching problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4058881
• scientific article; zbMATH DE number 1045407
• scientific article; zbMATH DE number 3911754
• On Parallel Implementations of Deterministic Finite Automata
• Finite automata for generalized approach to backward pattern matching

Cited in

(5)

• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Finite automata for generalized approach to backward pattern matching
• On Parallel Implementations of Deterministic Finite Automata
• Simultaneous search for several binary patterns in a stream with finite-state automaton

This page was built for publication: Distributed pattern matching using finite automata

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