357 views
4 4 votes

Consider the machine $M^{\prime}$ :

 

The language recognized by $M^{\prime}$ is:
 

  1. $\left\{w \in\{0,1\}^* \mid\right.$ $w$ HAS AN EVEN NUMBER OF $0$s AND AN EVEN NUMBER OF $1$s$\}$
     
  2. $\left\{w \in\{0,1\}^* \mid\right.$ $w$ HAS AN ODD NUMBER OF $0$s AND AN EVEN NUMBER OF $1$s$\}$
     
  3. $\left\{w \in\{0,1\}^* \mid\right.$ $w$ HAS AN EVEN NUMBER OF $0$s AND AN ODD NUMBER OF $1$s$\}$
     
  4. $\left\{w \in\{0,1\}^* \mid\right.$ $w$ HAS AN ODD NUMBER OF $0$s AND AN ODD NUMBER OF $1$s$\}$

1 Answer

1 1 vote
option B is false for the input 00011

option C is false for the input 00111

option D is false for the input 0001

ANSWER: A
Answer:
Position:
Show:

Related questions

5 5 votes
1 1 answer
358
358 views
GO Classes asked Nov 13, 2025
358 views
CONSIDER A DFA OVER $\Sigma=\{a, b\}$ THAT ACCEPTS A STRING $w$ IF AND ONLY IF $w$ CONTAINS THE SUBSTRING "$ab$" AND ALSO ENDS WITH THE SUFFIX "$bb$".WHAT IS THE MINIMUM ...
7 7 votes
1 1 answer
309
309 views
GO Classes asked Nov 13, 2025
309 views
CONSIDER A DFA OVER $\Sigma=\{a, b\}$ THAT ACCEPTS A STRING $w$ IF AND ONLY IF $w$ SATISFIES BOTH OF THE FOLLOWING CONDITIONS:THE NUMBER OF $a^{\prime} \mathrm{S}$ IN $w$...
2 2 votes
1 1 answer
275
275 views
GO Classes asked Nov 13, 2025
275 views
CONSIDER TWO PROBLEMS: $L_1$ IS A DECIDABLE LANGUAGE, AND $L_2$ IS A RECURSIVELY ENUMERABLE (R.E.) BUT NOT DECIDABLE LANGUAGE. LET $L_3$ BE ANOTHER LANGUAGE.WHICH ONE OF ...
4 4 votes
3 3 answers
442
442 views
GO Classes asked Nov 13, 2025
442 views
WHICH OF THE FOLLOWING LANGUAGES IS ACCEPTED BY A DETERMINISTIC PUSHDOWN AUTOMATA (DPDA)?$L_1=\left\{a^n b^n c^k \mid n, k \geq 0\right\} \cup\left\{a^i b^j c^j \mid i, j...