A formalisation of the Cocke-Younger-Kasami algorithm

Maksym Bortin 📧

April 27, 2016

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

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.

License

BSD License

Topics

Session CYK

Cite

× 
@article{CYK-AFP,
  author  = {Maksym Bortin},
  title   = {A formalisation of the Cocke-Younger-Kasami algorithm},
  journal = {Archive of Formal Proofs},
  month   = {April},
  year    = {2016},
  note    = {\url{https://isa-afp.org/entries/CYK.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: