- #1

Lolligirl

- 23

- 0

Okay, so here's a question I'm working on:

Question: Present the transition diagram or table for a DFA that accepts the regular set denoted by the expression (0+1)* (010 + 11) (0 + 1)*

Here is my DFA:

https://dl.dropboxusercontent.com/u/5778771/Midterm1SampleQuestion1.jpg

But it took me a decent while and a possibly error-prone amount of thought to come up with that, and I don't even know if it's right.

My question to you all is, are there any shortcuts or -definite- ways to come up with the correct DFA for a regex, or do you maybe have some advice to keep in mind when I'm doing so? I'm quite good at state-ripping and going from a DFA to a regex (not so good at going from an unconverted NFA to a regex due to epsilon confusions, but I digress), but I'm not sure how to go the other way efficiently.

Question: Present the transition diagram or table for a DFA that accepts the regular set denoted by the expression (0+1)* (010 + 11) (0 + 1)*

Here is my DFA:

https://dl.dropboxusercontent.com/u/5778771/Midterm1SampleQuestion1.jpg

But it took me a decent while and a possibly error-prone amount of thought to come up with that, and I don't even know if it's right.

My question to you all is, are there any shortcuts or -definite- ways to come up with the correct DFA for a regex, or do you maybe have some advice to keep in mind when I'm doing so? I'm quite good at state-ripping and going from a DFA to a regex (not so good at going from an unconverted NFA to a regex due to epsilon confusions, but I digress), but I'm not sure how to go the other way efficiently.

Last edited: