2. (a) Build a nondeterministic finite automaton that accepts the language (we (a,b): w contains abab},...

 

Transcribed Image Text:

2. (a) Build a nondeterministic finite automaton that accepts the language (we (a,b): w contains abab}, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler. (b) Build a nondeterministic finite automaton that accepts the language {w (a,b) (w begins with a and has odd length) or (w begins with b and has even length)}, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler. (c) Build a nondeterministic finite automaton with 3 states that accepts the language 0*1*0*0, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler. 2. (a) Build a nondeterministic finite automaton that accepts the language (we (a,b): w contains abab}, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler. (b) Build a nondeterministic finite automaton that accepts the language {w (a,b) (w begins with a and has odd length) or (w begins with b and has even length)}, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler. (c) Build a nondeterministic finite automaton with 3 states that accepts the language 0*1*0*0, by drawing its state diagram. You should leverage nondeterminism to make your machine clearer and simpler.