[PDF] Assignment 3 SOLUTIONS PDF solution

Question 1 [3 marks] Use the product construction to construct a deterministic finite automaton (DFA) that accepts all binary strings with an even number of 0's

Problem 3 Write regular expressions for the following languages: (c) The set of strings of 0's and 1's whose number of 0's is divisible by five and whose

[PDF] Homework 1 Problems

29 sept 2015 · (b) The set of all strings whose tenth symbol from the left end is a 1 3 (d) The set of strings such that the number of 0's is divisible by five, and

[PDF] 60-354, Theory of Computation Fall 2011 - Asish Mukhopadhyay

Construct a DFA that accepts all strings over {0,1} decimal, is divisible by 5 (or, multiple of 5) 3 – The set of all strings such that each block of five consecutive symbols contains at least two 0's of all strings of 0's and 1's whose number of

[PDF] Homework 3 Solutions

Homework 3 Solutions 1 Give NFAs with the specified number of states recognizing each of (c) The language { w ∈ Σ∗ w contains at least two 0s, or exactly two 1s } with six Note that M′ accepts the string 100 ∈ C = { w w does not end with 00 }, so Thus, we first create a DFA state corresponding to the set {1, 2}:

Exercises

(b) the set of strings in {a} * whose length is divisible by either 2 or 7; (e) the set of strings in {O, 1, 2} * that are ternary (base 3) representa- (c) {x I x contains an even number of a's or an odd number of b's} A context-sensitive grammar (CSG ) or type 1 grammar is a type 0 (Sanity check: the string has five parse trees )

[PDF] DFA for all strings in which the number of 0s is even and the

number 0s read modulo 2, the other indicating the number of 1s read modulo 3 binary strings divisible by 3, the other accepting ternary strings divisible by 4 Solution: The language is identical to the set of strings w such that w mod 12

[PDF] CS310 : Automata Theory 2019 - Cse iitb

Ashutosh Gupta and S Akshay Compile date: 2019-01-22 1 In the lecture, we added an (a) the set of binary strings whose number of 0's divisible by five