Explain, in your own language, that 1ⁿ0ⁿ, for n>1 is not accepted by a DFA using the following two methods:

Showing that the expression contradicts with pumping lemma requirements.

Showing that the expression will require a DFA with an infinite number of states to be accepted.

Compute AUB, A* and AB for the following A and B.

A={ab*|c} and B={d}

Draw three DFAs to accept AUB, A* and AB for the following A and B.

A={ab*|c} and B={d}

What languages the following two grammars individually generate ?

Grammar 1

A a

A aB

B c

B d

Grammar 2

A aC

A aB

B cB

B

C

Build grammars for each of the following regular languages:

Language 1: a*bc

Language 2: a⁺bc*