An optimal parallel algorithm for learning DFA

MaRDI QIDQ4942035zbMATH OpenFDO

Authors José L. Balcázar, Ricard Gavaldà, Osamu Watanabe, J. Díaz

Publication date 12 March 2001

zbMATH Keywords

deterministic finite automatasequential algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1008506
• A parallel DFA minimization algorithm
• The query complexity of learning DFA
• scientific article; zbMATH DE number 1303603
• Learning deterministic finite automata from smallest counterexamples

Cited in

(6)

• The query complexity of learning DFA
• Learning deterministic finite automata from smallest counterexamples
• scientific article; zbMATH DE number 1008506 (Why is no real title available?)
• A parallel DFA minimization algorithm
• scientific article; zbMATH DE number 1419219 (Why is no real title available?)
• Parallel algorithms for minimal nondeterministic finite automata inference

This page was built for publication: An optimal parallel algorithm for learning DFA

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