And it is, but how about the smallest string we do accept, a1 ?

This makes us glad that the computer is doing the memorization instead of us doing it by hand.

Oh, b took us to exactly 2 and 3.

We can just start at the start state.

We want to print out this answer.

The empty string we start in state 1. We don't go anywhere because we're out of input.

Here we start in state 1. I don't consume anything and move to state 2.

Let's try the first one.

His application went through.

We wouldn't actually need this if we were doing a parser. This is for explanatory purposes only.

You pass in the input string, the start state or the current state, the edges, and the accepting states, and it returns true if that string is accepted by the finite state machine and false otherwise.

We see that a finite state machine accepts a string s if there exists even one path from the start state to any accepting state that follows s.

Your application for the Live Aboard Program has been accepted.

And then it's 1, 2, 3, and we accept.

What if I try to mix it up and make it something like a1a1a1 ?

The European Commission must consider our proposals when we reach the one million signatures required

Transmission aborted.

The father leaned against the door, his right hand stuck between two buttons of his buttoned up uniform.

So b, d, g, b, d, f.

If I have a finite state machine B, can I make a new finite state machine that accepts strings of this form x concatenated with x where x was a string accepted by B?

I thought, well, embracing otherness is embracing myself.

Process Cancelled...

So I did end up working for him in the White House.

Lets see how it goes.

For something like 1,2,3, we start here. 1,2,3, and we're in state 4, which accepts.

One of my favorite prisoners is number 6.

We see a 1. We move over here.

What do they do?

What I want you to do is fill in the blanks so that the regular expression and the grammar have the same language, accept exactly the same set of strings.

Operation aborted.

The receptionist forced me to sign my name on the paper.

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

However, this finite state machine does not allow us to accept on a single a.

A real life lexer will have one more bit of information that we didn't talk about in class.

receiving packet Connection refused

If you accept, here it was a string.

Accept signal

looking relatively promising if we have no C's we can have a star that's pretty good and we can also have an optional C. But here is a string accepted by this first regular expression C, AA that is not accepted by this machine.

Once we have repeated that process in every state edge thing in the graph, we're going to update our accepting state list accordingly.

So here's my start state. We'll call it 1.

A state isn't just an accepting state, it's an accepting state with a little label.

Four to five day a week psychoanalytic psychotherapy for decades and continuing, and excellent psychopharmacology.

We actually don't have any outgoing edges on uppercase H, so we fall off immediately and do not accept.

If you accept here in this over there, it was the token then.

And the nerves themselves are the ones who are receiving input.