### 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

- Computer science/Algorithms
- Computer science/Automata and formal languages

### Session CYK

- CYK

## Cite

×

CYK-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Apr 27, 2016 : Isabelle2016