1 1 vote Consider the set of all words over the alphabet $\{x, y, z\}$ where the number of $y$’s is not divisible by 2 or 7 and no $x$ appears after a $z$. This language is: regular not known to be regular context-free but not regular recursively enumerable but not context-free Theory of Computation cmi2013 theory-of-computation identify-class-language + – go_editor 724 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes It will be regular It consists of 14 states where 1st state consists of x or z srestha answered May 23, 2016 srestha comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Answer: soujanyareddy13 answered May 7, 2021 soujanyareddy13 comment Share Follow 0 reply Please log in or register to add a comment.