DIU-BLC
Theory of Computation (Fall 2024)
0%
Previous
Course data
General
Announcements
CSE228 Course Outline
Assessment Info
Reference Book Link
General Discussion
Announcements
Class Routine and Counseling Hour
Assignment_Section_N
Assignment_01
Lecture 1: Introduction
Lecture Content
Finite Automata (FA)
Lecture 2
Lecture 2.1
Deterministic Finite Automata (DFA)
DFA Construction Problems
Demonstration Lecture DFA Construction
Demonstration Lecture DFA Construction Part 2
Practice Problems from DFA Constructions
Non-deterministic Finite Automata (NFA)
NFA Construction
Lecture Video [Google Meet]
NFA to DFA conversion
NFA to DFA Conversion
Lecture Video [Google Meet]
Midterm Syllabus
Course Plan
Regular Expression
Regular Expression
Regular Expression Exercise
Regular Expression Practice
Context Free Grammar (CFG)
Lecture Slide
Lecture Slide: Ambiguity
CFG Exercise
CFG Exercise
Pushdown Automata (PDA)
Push Down Automata (Lecture Slide)
Turing Machine (TM)
Turing machine Resources
Turing Machine
Quiz 1 Makeup
Presentation
Quiz 3
Quiz 3
Quiz 1
Quiz 3
Topic 18
Next
DIU-BLC
Side panel
Guidelines
For Teachers
For Students
Search
Close
Search
Toggle search input
Log in
Username
Password
Remember username
Forgot Password?
Log in
Create new account
Site Navigation
CSE 228 (SAJ-243)
Home
Skip to main content
Course info
Home
Courses
DIU
Faculty of Science and Information Technology
Computer Science and Engineering
CSE Fall 2024
CSE 228 (SAJ-243)
Summary
Theory of Computation (Fall 2024)
Teacher:
Sadia Jannat Mitu
Skill Level
:
Beginner