Question 9549 – Sequential-Circuits
March 13, 2024Question 10942 – Programming
March 13, 2024Question 5152 – Finite-Automata
The finite state machine given in figure below recognizes :
Correct Answer: D
Question 84 Explanation:
The language accepted by above finite automata is:
L = {ab,ba,ababab, bababa,……….}
Here L is the language containing odd number of a’s and odd number of b’s.
L = {ab,ba,ababab, bababa,……….}
Here L is the language containing odd number of a’s and odd number of b’s.
any string of odd number of a’s
any string of odd number of b’s
any string of even number of a’s and odd number of b’s
any string of odd number of a’s and odd number of b’s
Subscribe
Login
0 Comments