Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Theory of Computation
·
Module 1
Foundations: Languages, Strings, and Automata
1
Formal Definitions: Alphabets, Strings, and Languages
Define alphabets, strings, and languages formally.
2
String and Language Operations
Perform operations on strings and languages (union, concatenation, Kleene star).
3
Introduction to DFAs: Components and 5-Tuple Definition
Define a deterministic finite automaton (DFA) as a 5-tuple and explain its components.
4
DFA Computation Trace
Trace the computation of a DFA on a given input string.
5
Designing DFAs for Regular Languages
Design a DFA to recognize a given regular language.
6
Introduction to NFAs with Epsilon-Transitions
Define a nondeterministic finite automaton (NFA), including epsilon-transitions.
7
Designing NFAs for Language Recognition
Design an NFA to recognize a given language.
8
NFA to DFA Conversion (Subset Construction)
Convert an NFA to an equivalent DFA using the subset construction algorithm.
Next module isn't ready yet,
Back to course
Previous module
Next module