Question
a.
The language L={a^n b^n |n>0 } is regular
b.
The language L={a^n |n is prime } is regular
c.
The language L={w|w has 3k+1 b’s for some k } is regular
d.
None of these
Posted under 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. Which one of the following is TRUE?
Similar Questions
Discover Related MCQs
Q. The minimum state automaton equivalent to the below FSA has the following number of states
View solution
Q. The language accepted by this DFA is
View solution
Q. Which one of the following is FALSE?
View solution
Q. What is the complement of the language accepted by the NFA shown below?
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. 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!
