A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

Discussion Forum

Que. Minimal deterministic finite automaton for the language L = {0n | n ≥ 0 , n ≠ 4} will have
a. 4 final states among 5 states
b. 1 final state among 6 states
c. 3 final state among 6 states
d. 5 final state among 6 states
Answer:5 final state among 6 states
Sandeep :(September 21, 2020) Can you defind
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: