Register

What is the type of the language I,where L={a^nb^n|0<n<327 is prime number}

1,462 views
0 votes
0 votes
User Avatar

1 Answer

Best answer
6 votes
6 votes

L contains aabb, aaabbb, aaaaabbbbb, ... akbk where k is the largest prime below 327. Now there are only a finite set of strings in L making it a finite language. L can be accepted by a finite automaton. 

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

Related questions

2 votes
2 votes
0 answers
1
Meenakshi Sharma asked Aug 17, 2017
2,382 views
is the language L={a^nb^n : n>=1} U {b} is determinstic
is the language L={a^nb^n : n>=1} U {b} deterministic
is the language L={a^nb^n : n>=1} U {b} deterministic
User Avatar
2 votes
2 votes
2 answers
2
Anurag_s asked Aug 15, 2015
3,306 views
Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
User Avatar
0 votes
0 votes
0 answers
4
koushriek asked May 19, 2022
1,399 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!