Regex to NFA Conversion Isn't Hard! (Sipser 1.28a)

Here we do an example of the regular expression to nondeterministic finite automaton (NFA) conversion. The basic idea is to make a small NFA for the "indivisible" pieces, then combine them using union, concatenation, and star as the case may be.

Easy Theory Website: https://www.easytheory.org
Discord: Discord: discord

If you like this content, please consider subscribing to my channel: @easytheory

▶SEND ME THEORY QUESTIONS◀
[email protected]

▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

• #education
• #gnfa_method
• #nfa_to_regex
• #dfa_to_regex
• #gnfa_conversion
• #regular_expression
• #easy_theory
• #nfa_conversion
• #nfa_to_regex_conversion
• #nfa_rip_states
• #finite_automata_to_regular_expression
• #dfa_to_regular_expression_conversion
• #nfa_to_regex_example
• #nfa_to_regular_expression
• #dfa_to_regex_example
• #nfa_to_regular_expression_conversion
• #dfa_to_regex_algorithm
• #dfa_to_regex_examples
• #nfa_to_regex_converter
• #dfa_rip_states
• #dfa_to_regular_expression
• #easy_theory_regex