Connected Components of Chaos podcast

Decoding Language: The Power of Context-Free Grammars in Computing

0:00
17:07
Rewind 15 seconds
Fast Forward 15 seconds
This bonus episode explores what context-free grammars are in automata theorem. 

Visit our website here: https://sites.google.com/view/connected-components/home

More episodes from "Connected Components of Chaos"