5 votes 5 votes L = {an: n is either prime or the product of two or more prime numbers}, This language is regular ...right ? Please verify ... The equivalent language is L = { an ; n >= 2 } ...right ? Theory of Computation theory-of-computation finite-automata + – Vicky rix asked Apr 4, 2017 retagged Jun 4, 2017 by Arjun Vicky rix 575 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Devshree Dubey commented Apr 4, 2017 reply Follow Share shouldn't it be n mod 2?? 0 votes 0 votes Vishal Goyal commented Jul 3, 2017 reply Follow Share very nice question 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes yes ans reg expression is $aaa^{*}$ 2018 answered Apr 4, 2017 selected Apr 4, 2017 by Vicky rix 2018 comment Share Follow See all 0 reply Please log in or register to add a comment.