Regular Expression to E-NFA to DFA
This document provides a clear and step-by-step guide to converting a Regular Expression into an Equivalent Nondeterministic Finite Automaton (E-NFA) and subsequently into a Deterministic Finite Automaton (DFA). Ideal for students and professionals seeking a practical understanding of automata theory and compiler design.
Written for
- Institution
- BINUS University
- Course
- COMP6062001
Document information
- Uploaded on
- February 28, 2025
- Number of pages
- 3
- Written in
- 2023/2024
- Type
- Class notes
- Professor(s)
- Ivan sebastian edbert
- Contains
- All classes
Subjects
-
enfa
-
dfa
-
compilation
-
compilation techniques
-
compiler
-
thompson construction
-
re