0 votes 0 votes L={0p | p is a prime number over alphabet 0} Is L* regular? If yes, what is DFA for it? What is cardinality for it? Theory of Computation theory-of-computation regular-language + – srestha asked Nov 29, 2017 srestha 578 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments srestha commented Dec 1, 2017 reply Follow Share but cardinality shouldnot infinite ans given cardinality 1 0 votes 0 votes Namit Dhupar commented Dec 1, 2017 reply Follow Share @sreshtha, I think it's not regular... Well, simply speaking... Regularity is all about following a certain pattern under certain conditions.. example, let's say if a pattern is in AP(Arithematic progression) it's indeed regular... for prime numbers there can't be any such pattern... (Op where P is prime)should be recursively enumerable instead... Please correct me if i am wrong! 0 votes 0 votes Shiva Sagar Rao commented Apr 24, 2021 reply Follow Share https://gateoverflow.in/61607/toc-regular 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes L= {o^2 , o^3, o^5, o^7.....}* = {epsilon ,00,000,0000..... } {All strings except one} cardinality =3 Akash Mittal answered Nov 29, 2017 Akash Mittal comment Share Follow See all 0 reply Please log in or register to add a comment.