Efficient divide-and-conquer implementations of symmetric FSAs

MaRDI QIDQ3589613zbMATH OpenFDO

Authors David Pritchard

Publication date 20 September 2010

zbMATH Keywords

finite state automatondeterministic automatonnetworks of automatasequential automatonsymmetric automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1419219
• scientific article; zbMATH DE number 1213009
• scientific article; zbMATH DE number 3982526
• On Parallel Implementations of Deterministic Finite Automata
• scientific article; zbMATH DE number 1955813

This page was built for publication: Efficient divide-and-conquer implementations of symmetric FSAs

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