Question

ii) Write DFA to accept strings of 0’s, 1’s & 2’s beginning with a 0 followed by odd number of 1’s and ending with a 2.

Answer 1

Answer:

here is the diagram

Explanation:

Answer 2

Answer:

Given below is the answer

Explanation:

Deterministic finite automata are referred to as DFA. Deterministic refers to the computation's uniqueness. If the machine reads an input string one symbol at a time, the finite automata are referred to as deterministic finite automata.

For specified input, there is only one path from the current state to the following state in DFA.

DFA cannot change states without any input characters, hence it does not allow null moves.

DFA may include several final states. It is utilised in the compiler's Lexical Analysis.

As shown in the graphic below, there is just one path that leads from state q0 for input a to q1. Similar to this, there is only one way for input b to reach q2 from q0.

See more:

https://brainly.in/question/47743196

#SPJ2