Efficient polynomial-time algorithms for the membership problem are the CYK algorithm and Earley's Algorithm.
•
Parser algorithms for context-free languages include the CYK algorithm and the Earley's Algorithm.
In computer science, the Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) is a parsing algorithm for context-free grammars, its name came from the inventors, John Cocke, Daniel Younger and Tadao Kasami.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | Root-finding algorithm | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm | Vatti clipping algorithm | Sorting algorithm | Secure Hash Algorithm (disambiguation) | Schoof's algorithm | Schoof–Elkies–Atkin algorithm | root-finding algorithm | Rete algorithm |