Question
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
a.
1, 2, 3
b.
2, 3, 4
c.
1, 2, 4
d.
1, 3, 4
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. Given the language L = {ab, aa, baa}, which of the following strings are in L* ? 1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa
Similar Questions
Discover Related MCQs
Q. Choose the correct statement for the following:
View solution
Q. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* .
View solution
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?
View solution
Q. Myhill-Nerode Theorem is used for __________
View solution
Q. Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least
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!
