Register

The language of primes in unary is

2,851 views

1 Answer

8 votes
8 votes

D.Context sensitive

it will be l={1^p  where p is prime} ..it cant be regular as there is no pattern in the strings generated that we can remember, also we cant generate primes using   FA+ one stack ie pda.

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

Related questions

1 votes
1 votes
1 answer
2
rahul sharma 5 asked Aug 7, 2017
456 views
TOC String matching in unary aplphabet
w is defined to unary alphabet 1. L={ ww } 2.L={ w w^r } ,w^r is reverse of w Can i say both of these are regular?
w is defined to unary alphabet1. L={ ww }2.L={ w w^r } ,w^r is reverse of wCan i say both of these are regular?
User Avatar
0 votes
0 votes
0 answers
4
koushriek asked May 19, 2022
1,347 views
Number of states in a DFA that accepts the language over the alphabet{0,1} where words start and end with a '1', have even length and where any 0 in the word is immediately followed by at least a 1.
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...
User Avatar
Link Copied!