The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged ullman
0
votes
0
answers
1
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.8 (Page No. 54)
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

21
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
2
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.7 (Page No. 54)
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

17
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
3
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.6 (Page No. 54)
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 $,$ is a multiple of $5$ For example $,$ ... a binary integer $,$ is divisible by $5.$ Examples of strings in the language are $0,10011,1001100,$ and $0101.$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

196
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
4
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 symbol from the ... that the number of $0's$ is divisible by five $,$ and the number of $1's$ is divisible by $3.$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

33
views
ullman
theoryofcomputation
descriptive
0
votes
1
answer
5
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.
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

96
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
6
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,$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

14
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
7
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.6 (Page No. 36)
The binary string $X$ [shown online 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$.$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

16
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
8
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.5 (Page No. 35)
What is the concatenation of $X$ and $Y?$ [shown online by the Gradiance system from a stock of choices] is$:$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

13
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
9
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.4 (Page No. 35)
The length of the string $X$ [shown online by the Gradiance system from a stock of choices] is$:$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

7
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
10
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)(n1)}{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.
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

15
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
11
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.$
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

15
views
ullman
theoryofcomputation
descriptive
0
votes
0
answers
12
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.
asked
Apr 3, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

23
views
ullman
theoryofcomputation
descriptive
Page:
« prev
1
...
6
7
8
9
10
11
Quick search syntax
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
Recent Posts
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged ullman
Recent Blog Comments
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
ISI 2019 : Aarushi Aiyyar's answer to How do...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,481
answers
201,804
comments
95,280
users