EulerFold
ToolsGeneratorPlannerPractice
Research & LibraryResearchArticlesLibraryLeaderboard
PlatformAboutPricing
Get Started
Aspiring Computer Scientists

Formal Languages & Automata Theory

8 weeks
0 Learners
eulerfoldeulerfold
Jul 23

“Understand regex, state machines, and grammars before building ASTs or compilers.”

Share:

What you'll learn

Understand regular languages and finite automata
Construct context-free grammars
Analyze pushdown automata and Turing machines
Grasp computability and the halting problem

Prerequisites

Level

W1

Fundamentals of Automata

Establish the mathematical foundation for formal languages.

2 videos•29m
3 readings
2 topics
1 homework
Learn

Topics

1.1
Basic Definitions
11 minutes
1.2
Operations on Languages
18 minutes

Study Resources

→Automata theory - Wikipedia→Alphabets, Strings, and Languages - Theoretical Computer Science→Language and Grammar in Automata Theory
W2

Deterministic Finite Automata (DFA)

Design strict state machines for language recognition.

2 videos•31m
3 readings
2 topics
1 homework
Learn
W3

Non-Deterministic Finite Automata (NFA)

Understand non-determinism and equivalence to DFA.

2 videos•22m
2 readings
2 topics
1 homework
Learn
W4

Regular Expressions and Languages

Map regular expressions to finite automata computationally.

2 videos•51m
3 readings
2 topics
1 homework
Learn
W5

Properties of Regular Languages

Prove the limits of what finite automata can compute.

2 videos•19m
3 readings
2 topics
1 homework
Learn
W6

Context-Free Grammars (CFG)

Define languages that require recursive nesting.

2 videos•21m
3 readings
2 topics
1 homework
Learn
W7

Pushdown Automata (PDA)

Augment finite automata with a stack memory.

2 videos•37m
3 readings
2 topics
1 homework
Learn
W8

Turing Machines and Computability

Explore the ultimate model of computation.

2 videos•17m
3 readings
2 topics
1 homework
Learn
01

Learn

Watch curated videos and read study resources

02

Practice

Practice what you learned

03

Build Projects

Build projects using your new gained knowledge

04

Submit & Verify

Submit your project and get verified by our system

References

01Automata theory - Wikipedia
02Alphabets, Strings, and Languages - Theoretical Computer Science
03Language and Grammar in Automata Theory
04Deterministic Finite Automata
05Deterministic Finite Automata | PPTX
06Deterministic finite automaton
07Difference Between NFA and DFA: Clear Concepts, Examples, and...
08The Fundamental Differences Between DFA and NFA: A Detailed...
09Regular language - Wikipedia
10Kleene's Theorem in TOC - GeeksforGeeks
11Kleene's Theorem: Regular Expressions, Automata, GraphsRegular Expressions - Stanford UniversityRegular Languages & Kleene's Theorem: Lecture NotesKleene's Theorem in Automata Theory - Online Tutorials LibraryLecture 23: regular languages and Kleene’s theoremRegular language - Wikipedia
12Pumping Lemma; Closure properties of regular languages
13Non-regular Languages
14Properties of Regular Languages
15CYK algorithm - Wikipedia
16Parse trees, ambiguity, and Chomsky
17Context free grammars
18COMS W3261 CS Theory Lecture 8: Pushdown Automata
19Introduction of Pushdown Automata - GeeksforGeeks
20Construct Pushdown Automata for given languages
21Halting problem - Wikipedia
22Halting Problem in Theory of Computation - GeeksforGeeks
23Computability: Turing Machines and the Halting ProblemHalting ProblemDid Turing prove the undecidability of the halting problem ...Did Turing prove the undecidability of the halting problem?Halting Problem: A Deep Dive - numberanalytics.com

Rate this course

0.0
0 reviews

Help the community find verified technical paths.

Community Insights

0

Join the discussion

Sign in to share your thoughts and technical insights.

Loading insights...