Recent questions tagged ullman / GATE Overflow for GATE CSE

Give DFA's accepting the following languages over the alphabet $\{0,1\}$$a)$ The set of all strings beginning with a $1$ that $,$ when interpreted as a binary integer $,$...

admin

1.9k views

admin asked Apr 2, 2019

0 votes

0 answers

307

Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.5 (Page No. 53 - 54)
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$ $a)$ The set of all strings such that each block of ve consecutive symbols contains atleat two $0's.$ $b)$ The set of all strings whose tenth ... number of $0's$ is divisible by five $,$ and the number of $1's$ is divisible by $3.$

Give DFA's accepting the following languages over the alpabet $\{0,1\}:$$a)$ The set of all strings such that each block of ve consecutive symbols contains atleat two $0'...

admin

441 views

admin asked Apr 2, 2019

0 votes

1 answer

308

Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.4 (Page No. 53)
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$ $a)$ The set of all strings ending in $00.$ $b)$ The set of all strings with three consecutive $0's$ (not necessarily at the end)$.$ $c)$ The set of strings with $011$ as a substring.

Give DFA's accepting the following languages over the alpabet $\{0,1\}:$$a)$ The set of all strings ending in $00.$$b)$ The set of all strings with three consecutive $0's...

admin

3.1k views

admin asked Apr 2, 2019

1 votes

0 answers

309

Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.3 (Page No. 53)
Show that for any state $q,$ string $x,$ and input symbol $a,$

Show that for any state $q,$ string $x,$ and input symbol $a,$

admin

244 views

admin asked Apr 2, 2019

0 votes

0 answers

310

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.6 (Page No. 36)
The binary string $X$ [shown on-line by the Gradiance systems] is a member of which of the following problems$?$Remember$,$a $"$problem$"$ is a language whose strings represent the cases of a problem ... palindromes$,$ which are strings that are identical when reversed$,$like $0110110,$ regardless of their numerical value$.$

The binary string $X$ [shown on-line by the Gradiance systems] is a member of which of the following problems$?$Remember$,$a$"$problem$"$ is a language whose strings repr...

admin

166 views

admin asked Apr 2, 2019

0 votes

0 answers

311

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.5 (Page No. 35)
What is the concatenation of $X$ and $Y?$ [shown on-line by the Gradiance system from a stock of choices] is$:$

What is the concatenation of $X$ and $Y?$ [shown on-line by the Gradiance system from a stock of choices] is$:$

admin

110 views

admin asked Apr 2, 2019

0 votes

0 answers

312

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.4 (Page No. 35)
The length of the string $X$ [shown on-line by the Gradiance system from a stock of choices] is$:$

The length of the string $X$ [shown on-line by the Gradiance system from a stock of choices] is$:$

admin

156 views

admin asked Apr 2, 2019

0 votes

0 answers

313

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.3 (Page No. 35)
Suppose we want to prove the statement $S(n):$ $"$If $n\geq 2,$ the sum of the integers $2$ through $n$ is $\frac{(n+2)(n-1)}{2}"$ by induction on $n.$ To prove the inductive step$,$ we can make use of the fact ... $,$ in the list below an equality that we may prove to conclude the inductive part.

Suppose we want to prove the statement $S(n):$ $"$If $n\geq 2,$ the sum of the integers $2$ through $n$ is $\frac{(n+2)(n-1)}{2}"$by induction on $n.$ To prove the induct...

admin

124 views

admin asked Apr 2, 2019

0 votes

0 answers

314

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.2 (Page No. 35)
To prove $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D)$ by contradiction$,$which of the statements below would we prove$?$Note$:$ each of the choices is simplified by pushing $NOT's$ down until they apply only to atomic statements $A$ through $D.$

To prove $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D)$ by contradiction$,$which of the statements below would we prove$?$Note$:$ each of the choices is simplified b...

admin

167 views

admin asked Apr 2, 2019

0 votes

0 answers

315

Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.1 (Page No. 35)
Find in the list below the expression that is the contrapositive of $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D).$ Note: the hypothesis and conclusion of the choices in the list below may have some simple logical rules applied to them, in order to simplify the expression.

Find in the list below the expression that is the contrapositive of $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D).$Note: the hypothesis and conclusion of the choices...

admin

194 views

admin asked Apr 2, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true