Sign inSign in

Decidability of ECFGE_{CFG}

The emptiness problem for context-free grammars is decidable by working backwards from the terminals to mark variables that generate terminal strings.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Context-free grammar1Decidability1Terminals and variables1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.