CS 4384 — Automata Theory, Homework 2
Let L1, L2 ⊆ {0, 1}∗ be two languages and defined as follows: ;
Construct NFAs and that accept and respectively
=
=
Let and be the regular expressions representing and , respectively. Design NFAs for
Convert the following regular expressions to NFAs.
Convert the REs mentioned in the Exercise 1.19 on page 86 to equivalent DFAs
Ad Hoc:
RE to NFA Conversion:
Ad Hoc:
RE to NFA Conversion
Ad Hoc:
RE to NFA: