Conversion of Regular Expression to Finite Automata Using Subset Method in Automata Theory

Offered By: Sundeep Saradhi Kanthety via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Learn how to convert regular expressions to finite automata using the subset method in automata theory. Explore the three-step process: constructing an NFA with epsilon transitions, converting it to an NFA without epsilon transitions, and finally transforming it into a DFA. This 21-minute video tutorial provides a comprehensive explanation of the subset method, essential for understanding the relationship between regular expressions and finite automata in the theory of computation.

Syllabus

CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING SUBSET METHOD IN AUTOMATA THEORY || TOC

Taught by

Sundeep Saradhi Kanthety

Related Courses

Design of Computer Programs
Stanford University via Udacity Programming Languages
University of Virginia via Udacity Data Structures and Performance
University of California, San Diego via Coursera Introducción a Data Science: Programación Estadística con R
Universidad Nacional Autónoma de México via Coursera Applied Text Mining in Python
University of Michigan via Coursera