Formal Languages and Automata Theory
Introduction to Automata Theory, Languages and Computation
4.44 (234 reviews)
8,046
students
37 hours
content
Aug 2024
last update
$49.99
regular price
What you will learn
Develop a formal notation for strings, languages and machines.
Design finite automata to accept a set of strings of a language.
Prove that a given language is regular and apply the closure properties of languages.
Design context free grammars to generate strings from a context free language and convert them into normal forms.
Prove equivalence of languages accepted by Push Down Automata and languages generated by context free grammars.
Identify the hierarchy of formal languages, grammars and machines
Distinguish between computability and non-computability and Decidability and undecidability.
Screenshots
Related Topics
3901662
udemy ID
3/9/2021
course created date
5/12/2021
course indexed date
Bot
course submited by