Practicing DFSA and Regular expressions
After going to the tutorials on the last
week, I finally got how to simplify a DFSA down to a few basic states and find
out its regular expression.
Let’s Devise a DFSA that accepts the
language of strings over {0,1} with even number of both 0 and 1s. From the
DFSA, let’s devise the regular expression that denotes the same language.
The DFSA would probably look like this:
The final regular expression would be: R*+(SQ*T)*
No comments:
Post a Comment