2 votes 2 votes Is the following language a regular language.: L={ (a^p)*|p is a prime no} ....? If so, then how many min no of states in NFA that accepts a lang L? Theory of Computation theory-of-computation regular-language finite-automata + – Chetnawadhwa asked Jul 18, 2016 • retagged Jun 4, 2017 by Arjun Chetnawadhwa 854 views answer comment Share Follow See 1 comment See all 1 1 comment reply LeenSharma commented Jul 18, 2016 i edited by LeenSharma Jul 19, 2016 reply Follow Share yes,It is regular language.we can draw 3 states finite automata for this language. 1 votes 1 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Yes it is a regular langulage shantanu kaushik answered Jul 18, 2016 • selected Nov 25, 2016 by Chetnawadhwa shantanu kaushik comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments shantanu kaushik commented Sep 11, 2016 reply Follow Share It is not language of prime numbers if you observe carefully. Kleene's operator is playing a vital role. Please analyse yourself to improve your understanding on it and if you find difficulty then reply on this, I'll share the dfa for this expression. Thanks, Shantanu 0 votes 0 votes Hira Thakur commented Sep 12, 2016 reply Follow Share I got the point please shear the dfa for this problem 0 votes 0 votes Arjun commented Nov 25, 2016 reply Follow Share @Anirudh Nopes. $a^2, a^3$ these two ensures that all other strings are generated. Just $a^2$ will make only even numbered strings. 1 votes 1 votes Please log in or register to add a comment.
