1 votes 1 votes closed with the note: got it CFL over a single alphabet are always-> A. dcfl B. regular C. dcfl but not regular d. non regular Theory of Computation theory-of-computation context-free-language closure-property regular-language + – raviyogi asked Dec 30, 2017 closed Dec 30, 2017 by raviyogi raviyogi 669 views comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Answer is REGULAR. For detailed answer please refer: https://gateoverflow.in/184786/context-free-language sh!va answered Dec 30, 2017 sh!va comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Apr 8, 2018 reply Follow Share a^p, where p is a prime number? Is it regular? 0 votes 0 votes Please log in or register to add a comment.