From: Tobias Nipkow <nipkow@in.tum.de>
A formalisation of the Cocke-Younger-Kasami algorithm
Maksym Bortin
The theory provides a formalisation of the Cocke-Younger-Kasami algorithm (CYK
for short), an approach to solving the word problem for context-free languages.
CYK decides if a word is in the languages generated by a context-free grammar in
Chomsky normal form. The formalized algorithm is executable.
http://www.isa-afp.org/entries/CYK.shtml
Enjoy!
smime.p7s
Last updated: Nov 21 2024 at 12:39 UTC