Taking people's orders.

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.

I don't take orders from criminals, I arrest them.

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.

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?

Your demands are unreasonable.

One of my favorite prisoners is number 6.

Then, just a little bit...

So let's come up with an example.

From Santa Luca, senor.

Would you like to order?

Will you please check to see if my order has been dealt with?

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

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

What they wanna eat?

If 2 context free grammars, G1 and G2, both accept an infinite number of strings, than they accept the same strings.

Otherwise we will have to cancel this order.

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

Waiter, I'd like to order.

Waitress, I'd like to order.

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

What I'd like you to do is fill in each hole with the single word

It's what you guys order.

This isn't what I ordered.

This is not what I ordered.

Warning unsupported characters are displayed using the '_' character.

I have enclosed your order form.

In an example of a finite grammar, I simply took the infinite grammar, removed the a right here, and this grammar only accepts the string b.

Well, well, well. What can we do you tonight?

We always order

I give you the accepting states, just 6, and also all of the edges.

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

We ordered pink, but we received blue.

I received an item that I did not order.

I have 2 grammars.

You want to order?

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

We'd like to order 18 tonnes of olive oil.

I'll order that later.

OK, I'll order it.

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

Now, the thing about the autistic mind is it attends to details.

We can just start at the start state.

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

We will ship the product immediately after receiving your order.