Theory and languages
Automata and formal languages
Finite automata, regular expressions and context-free grammars. The maths behind every parser.
About 20 hours of study.
Where to learn it
Read
Models of Computation (lecture notes)
Jeff Erickson
Chapters on strings, regular languages and finite automata
Section not checked yet
Watch
Practise
No practice set picked yet.
Suggest oneOther options
- Theory of Computation (NPTEL) (watch)
The lectures on finite automata and context-free grammars
Which roles ask for it
- GATE computer science to get hired