Register

Regular Language

1,293 views
0 0 votes

L={0p | p is a prime number over alphabet 0}

Is L* regular? If yes, what is DFA for it? What is cardinality for it?

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Non Regular LanguageNext → · Sql query
← Previous in category · Non Regular LanguageNext in category → · TOC closure property...
Position:
Show:

Related questions

0 0 votes
1 1 answer
72
72 views
GO Classes asked 6 days ago
72 views
GO Classes DPP | GATE CS | Theory of Computation | Regular-Language Non-Emptiness
Which of the following is true?There is no known algorithm for checking whether a regular language is nonempty. The proof of the pumping lemma was a proof by induction. T...
2 2 votes
1 1 answer
92
92 views
GO Classes asked Sep 21
92 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $M$ and $N$ be two DFAs. Define$$Z=\{u_1v_1u_2v_2\cdots u_kv_k : k\ge0, ~u_i\in L(M), ~v_i\in L(N)\}.$$Which regular-language expression describes $Z$?$L(M)^*L(N)^*$ ...
0 0 votes
1 1 answer
74
74 views
GO Classes asked Sep 21
74 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
For an arbitrary language $L$, which of the following statements is correct?If $L^*$ is regular, then $L$ must be regular. If $L$ is nonregular, then $L^*$ must be nonreg...
1 1 vote
1 1 answer
85
85 views
GO Classes asked Sep 16
85 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $L=\{w\in{0,1}^*\mid w$ contains equal numbers of substrings $01$ and $10\}$. Which statements are correct?$L$ is regular. A correct regular expression for $L$ is $\e...