Question
a.
a
b.
b
c.
c
d.
d
Posted under DFA Minimization Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. A deterministic finite automation (DFA)D with alphabet ∑= {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D?
Similar Questions
Discover Related MCQs
Q. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* .
View solution
Q. Choose the correct statement for the following:
View solution
Q. Given the language L = {ab, aa, baa}, which of the following strings are in L* ?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
View solution
Q. What is the complement of the language accepted by the NFA shown below?
View solution
Q. Which one of the following is FALSE?
View solution
Q. The language accepted by this DFA is
View solution
Q. The minimum state automaton equivalent to the below FSA has the following number of states
View solution
Q. Which one of the following is TRUE?
View solution
Q. Consider the finite automaton in the following figure. What is the set of reachable states for the input string 0011 ?
View solution
Q. Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences
of (110)’s as (011)’s}.
Let L2 = { ∈ {0,1}∗ | w has at least as many occurrences
of (000)’s as (111)’s}.
Which one of the following is TRUE?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
