Question 3 Consider the following sets: S1. Set of all recursively enumerable languages over the alphabet {0,1} S2. Set of all syntactically valid C programs S3. […]
Question 1 The following deterministic finite automata recognizes : A Set of all strings containing ‘ab’ B Set of all strings containing ‘aab’ C Set of […]