Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

## Post a reply

Write your message and submit
|
Options

## Topic review (newest first)

gAr
2013-12-18 14:16:29

epsilon from 1* and next epsilon from (00+010+!)

anonimnystefy
2013-12-18 06:36:54

We can chose epsilon only once...

gAr
2013-12-18 03:42:48

It's expected since we can choose

anonimnystefy
2013-12-18 03:24:26

Doesn't that DFA also accept 0101?

gAr
2013-12-18 03:05:54

My bad, here is the diagram we get for the corrected expression.

anonimnystefy
2013-12-18 02:04:10

Where did you get the third Kleene star from?

gAr
2013-12-18 01:24:34

I was unable to upload earlier, this is the DFA I got.

gAr
2013-12-17 23:17:29

1. After entering the RE, choose convert->"convert to NFA"
2. "Do All" and "export"
3.  Convert->"convert to DFA" and "complete" and "Done"
4. Convert->"minimize DFA". Select root of the tree and "complete subtree", and "Finish"
5. Click "complete" and "Done"

gAr
2013-12-17 22:49:58

Hi evinda,

I understood the language to be

Since there are algorithms to convert from RE to NFA to DFA to minimized DFA, someone has written a software for that: JFLAP

Enter the RE as: 1*(00+010+!)(01)*

edit: corrected the RE

evinda
2013-12-17 09:45:24

#### anonimnystefy wrote:

Below is what I am getting.

I got a similar!!! Thank you very much!!!!

anonimnystefy
2013-12-17 09:08:29

Below is what I am getting.

evinda
2013-12-17 08:29:50

#### anonimnystefy wrote:

Hi evinda

Am getting a DFA with 5 states.

I tried to draw a DFA and I also got one with 5 states!!!!

anonimnystefy
2013-12-17 07:34:18

Hi evinda

Am getting a DFA with 5 states.

evinda
2013-12-17 06:30:50

#### bobbym wrote:

Hi;

I know what a regular expression is but I have no idea how to use it with cellular automata.

Have you tried the Stack Exchange or Stack Overflow?

I found similar questions with helpful answers there!Thanks for the hint

bobbym
2013-12-16 03:07:54

Hi;

I know what a regular expression is but I have no idea how to use it with cellular automata.

Have you tried the Stack Exchange or Stack Overflow?