Test Index

GATE Computer Science (CS) 2012 Solved Paper

© examsnet.com

Question : 56

Total: 65

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below.

The missing arcs in the DFA are

	00	01	10	11	Q
00	1	0
01				1
10	0
11			0

	00	01	10	11	Q
00		0			1
01		1
10				0
11		0

	00	01	10	11	Q
00		1			0
01		1
10			0
11		0

	00	01	10	11	Q
00		1			0
01				1
10	0
11			0

Go to Question:

Prev Question

Next Question