363 views
1 votes
1 votes

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:

  1. regular
  2. not known to be regular
  3. context-free but not regular
  4. recursively enumerable but not context-free

2 Answers

0 votes
0 votes
It will be regular

It consists of 14 states where 1st state consists of x or z

Related questions

7 votes
7 votes
1 answer
1
go_editor asked May 23, 2016
914 views
You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$-th smallest element in the union of the two ...