We see the a, self loop back to state 2. We see the 1. We're in state 3.

If I'm in 4, fall off the world.

In state 1 on a 'q', you loop back to state 1.

Since 3 is an accepting state up there, 2 or 3 is an accepting state down here.

If you quickly look at it and think about what's going on, once you take a path down the b to state 2, you can never get to the accepting state.

Here if I was in 2, 4, 5, or 6 and I see a c,

And on b we go to state 3, and then from state 2 on c we go to 4, and state 3 on d we go to 5, and 5 on e goes back to 2, and 5 on f goes to state 6, and 5 on g goes all the way back here to 1, and our only accepting state is 6.

From state 1 on b, we go to state 2 as well a or b.

All right, well, what if I see a b?

4 and I see a b I die.

How about 'aa'?

Well, one of our edges is at state 1 on 'a.' State 1 on input 'a' goes to state 2.

That's our self loop.

Finally, let's consider the string '2x'.

Application

Applications

Application

But let's just finish checking up on c just in case we missed something.

Over here, I have defined edges, just as we suggested.

Well, one possibility is that we're already at the end of the input, at which point we should just check to see if our current state is an accepting state or not.

Well, when we enter the non deterministic machine, we could only be in state 1, but after that we could see an a, and if I see an a I could be in 2, 4, or I could take the free epsilon transition to 5, or I could keep going and take the free epsilon transition to 6.

Lxkeymap application

Magicicada application

Application Id

Application Name

Application ID contains

Applications

Application

A KDE Application

Application

KDE Application

Application Identifier

In my converted world, the state accepts if any of its corresponding original states also accept.

6 and I see a b I die.

I haven't made any progress, so I'm going to stop following edges from the 1 along that path.

This new finite state machine will still accept 1, 2, 3.

Now, there's some other ways to get out of 2, 4, 5, and 6, and when we do, we might be in states 2 or 3.

I must really have been in state 3, and I stay in state 3, so either on b or c we end up in just state 3, which is also an accepting state.

We see the a. We're in state 2.

Here I have the declaration for my procedure.

I'll just put them together into one big machine.

Finally, you'll notice that 1 of my states has a double circle.

Maps application

Files Applications

Basic applications