Automata Theory & Formal Languages: Simplification of Context-Free Grammars (CFG) πŸ“˜

Explore the principles of automata, formal languages, and CFG simplification techniques with Prof. Kamala Krithivasan from IIT Madras. Enhance your understanding of computational theory today!

Automata Theory & Formal Languages: Simplification of Context-Free Grammars (CFG) πŸ“˜
nptelhrd
58.9K views β€’ Oct 5, 2011
Automata Theory & Formal Languages: Simplification of Context-Free Grammars (CFG) πŸ“˜

About this video

Theory of Automata, Formal Languages and Computation by Prof.Kamala Krithivasan,Department of Computer Science and Engineering,IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

58.9K

Likes

191

Duration

56:03

Published

Oct 5, 2011

User Reviews

4.0
(11)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.