Register

Regularity of the strings

• recategorized by
7,675 views

1 Answer

Best answer
9 votes
9 votes

A. string of 0's whose length is a perfect square. - CSL.

B. set of all palindromes made up of 0's and 1's  - CFL.

C. String of 0's whose length is prime number     - CSL.

Ans- D. all the above.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Garrett McClure asked Oct 3, 2017
516 views
Theory of Computation - Show that an algorithm exists for determining if L contains any strings of even length.
Let L be any regular language on Σ = {a, b}. Show that an algorithm exists for determining if L contains any strings of even length.
User Avatar
1 votes
1 votes
1 answer
3
rexritz asked Oct 8, 2023
253 views
Checking regularity of a given language.
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$ Is this language regular?
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$Is this language regular?
User Avatar
1 votes
1 votes
3 answers
4
dd asked Sep 29, 2016
678 views
Checking regularity of a given language.
$L = \left \{ a^nb^mc^p : n+m+p > 5 \right \}.$
$L = \left \{ a^nb^mc^p : n+m+p 5 \right \}.$
User Avatar
Link Copied!