Parallel decision procedures for finite state automata

DOI10.1080/00207169308804213MaRDI QIDQ4291044zbMATH OpenOpenAlexFDO

Authors Robert R. Goldberg, Jerry Waxman

Publication date 5 May 1994

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169308804213

zbMATH Keywords

classification problemcombinatorial circuitdecidable predicatesfinite state automataparallel algorithmreachability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1419219
• The parallel complexity of finite-state automata problems
• On Parallel Implementations of Deterministic Finite Automata
• Parallelization of automata
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• scientific article; zbMATH DE number 3890738
• scientific article; zbMATH DE number 1751911
• scientific article; zbMATH DE number 1751917
• Parallel algorithms for minimal nondeterministic finite automata inference

Cites work

• A Theorem on Boolean Matrices
• Communicating sequential processes

Cited in

(3)

• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• On Parallel Implementations of Deterministic Finite Automata
• A VLSI design for the parallel finite state automaton and its performance evaluation as a hardware scanner

This page was built for publication: Parallel decision procedures for finite state automata

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