Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Bikram
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Bikram
0
votes
1
answer
41
Test by Bikram | Theory of Computation | Test 2 | Question: 20
Which of the following pairs of regular expressions define the same language $\{a, b\}$? $(a^*+ b^*) ^*$ and $(a+ b)^*$ $(a^* b )^* a^*$ and $a(ba^* )^*$ $(a^*+ b)^*$ and $(a+ b)^*$ $(a b)^* a$ and $a (ba)^*$ $a, b$, and $d$ $a, c$, and $d$ $b,c,d$ $a,b,c$ and $d$
asked
in
Theory of Computation
Aug 12, 2017
248
views
tbb-toc-2
theory-of-computation
regular-expression
0
votes
1
answer
42
Test by Bikram | Theory of Computation | Test 2 | Question: 19
Which of the following statements is correct about the given Turing Machine transitions below? ... in $\Sigma ^*$. TM halts on all strings of even length. I and II II and IV II and III I , II and III
asked
in
Theory of Computation
Aug 12, 2017
482
views
tbb-toc-2
theory-of-computation
turing-machine
1
vote
1
answer
43
Test by Bikram | Theory of Computation | Test 2 | Question: 18
Which of the following languages is/are deterministic context-free? $L_1 = \{ ww^R \mid w \in \{a,b\}^* \text{ and } w^R \text{ is reverse of } w \}$ $L_2 = \{ ww^R x \mid w, x \in \{0,1\}^* \}$ $L1$ only $L2$ only Both $L1$ and $L2$ Neither $L1$ nor $L2$
asked
in
Theory of Computation
Aug 12, 2017
487
views
tbb-toc-2
theory-of-computation
context-free-language
identify-class-language
1
vote
0
answers
44
Test by Bikram | Theory of Computation | Test 2 | Question: 17
Match the following statements with True (T) / False (F) : $S1: \ CFG = \{ <G> \mid \text{ G is a CFG and } L (G) = \Sigma ^* \} \text{ is undecidable}$ ... , S2 - F, S3 - T , S4 - T S2 - T, S3 - F, S1 - T , S4 - T S1 - T, S2 - F, S3 - T , S4 - F
asked
in
Theory of Computation
Aug 12, 2017
432
views
tbb-toc-2
theory-of-computation
context-free-language
decidability
0
votes
0
answers
45
Test by Bikram | Theory of Computation | Test 2 | Question: 16
Consider the following incomplete DFA. What will be the transitions of state D such that automata will accept the set of all binary strings containing $010$ as sub-string ? $d (D,0)=A$ $d (D,1)=D$ $d (D,0)=C$ $d (D,1)=B$ $d (D,0)=D$ $d (D,1)=B$ $d (D,0)=D$ $d (D,1)=D$
asked
in
Theory of Computation
Aug 12, 2017
230
views
tbb-toc-2
theory-of-computation
finite-automata
0
votes
1
answer
46
Test by Bikram | Theory of Computation | Test 2 | Question: 15
Which of the following languages is regular? $L = \{ bba (ba)^* a^{n-1} \mid n> 0 \}$ $L = \{a^nb^n \mid n < 1000 \}$ $L = \{a^nb^k \mid \text{ n is odd or k is even} \}$ $L = \{ wxw^R \mid w,x \in (0+1)^* \}$ $1$, $3$ and $4$ $2, 3, 4$ $2, 3$ $1, 2, 3, 4$
asked
in
Theory of Computation
Aug 12, 2017
449
views
tbb-toc-2
theory-of-computation
regular-language
1
vote
1
answer
47
Test by Bikram | Theory of Computation | Test 2 | Question: 14
Which of the following is correct? $(01 )^* \cap (10)^* = \not{0}$ $(x + y + z)^* = x^*y^*z^* + x^*y^* + z^* + z^*x^*y^*$ $(p + q )^* p + ( p+q)^* q + \epsilon = (p^* q^*)^*$ $(m + n)^* \cap (m + n)^* mn \neq (m + n)^* mn$
asked
in
Theory of Computation
Aug 12, 2017
356
views
tbb-toc-2
theory-of-computation
regular-expression
0
votes
1
answer
48
Test by Bikram | Theory of Computation | Test 2 | Question: 13
Which of the following statements are NOT true? Given two regular grammars $G1$ and $G2$, it is undecidable whether $L (G1) = L (G2)$. Given two arbitrary context-free grammars $G1$ and $G2$ ... a particular non-terminal "X" in G is reachable. I,IV and II II and IV I and IV I,II and III
asked
in
Theory of Computation
Aug 12, 2017
437
views
tbb-toc-2
theory-of-computation
decidability
1
vote
1
answer
49
Test by Bikram | Theory of Computation | Test 2 | Question: 12
Choose the regular expression corresponding to the given DFA : $(00 ^*1 + 11^* 0) (0 + 1) ^*$ $((11) ^* 0 + 00 ^* 1)(0 + 1) ^*$ $(11) ^* (0 ^* 1 + 1^* 0) (0 + 1) ^*$ $(11) ^* (00 ^* 1 + 10) (0 + 1) ^*$
asked
in
Theory of Computation
Aug 12, 2017
298
views
tbb-toc-2
theory-of-computation
regular-expression
0
votes
2
answers
50
Test by Bikram | Theory of Computation | Test 2 | Question: 11
Consider the grammar given below: $S \rightarrow x \ T \mid y \ Z$ $Z \rightarrow x \mid x \ S \mid y \ Z \ Z$ $T \rightarrow y \mid y \ S \mid y \ T \ T$ Consider the following strings: $xxyyx$ $xxyyxy$ $xyxy$ ... Which of the above strings are generated by the given grammar? i, iv and iii ii, iii and iv ii, v and iv iii, iv and v
asked
in
Theory of Computation
Aug 12, 2017
344
views
tbb-toc-2
theory-of-computation
grammar
0
votes
0
answers
51
Test by Bikram | Theory of Computation | Test 2 | Question: 10
Match the correct automation given in Y to its transition function in $X$ ... III-D, IV-F I-B, II-C, III-E, IV-A I-C, II-B, III-E, IV-F I-B, II-C, III-F, IV-D
asked
in
Theory of Computation
Aug 12, 2017
267
views
tbb-toc-2
theory-of-computation
identify-class-language
1
vote
1
answer
52
Test by Bikram | Theory of Computation | Test 2 | Question: 9
Consider the following transition table of DFA where $q3$ ... The number of states required to represent the same language with minimum number of states automata is _________.
asked
in
Theory of Computation
Aug 12, 2017
482
views
tbb-toc-2
numerical-answers
theory-of-computation
minimal-state-automata
0
votes
1
answer
53
Test by Bikram | Theory of Computation | Test 2 | Question: 8
Which of the following Regular Expression is NOT the same as the other three? $100 ( ( (00)^* (10)^* )^* 100)^*$ $100 ( ( ( 0+1) 0)^* 100 )^*$ $100 ( (00 + 10)^* 100)^*$ $100 ( ((0+1)^* 0^* )^* 100)^*$
asked
in
Theory of Computation
Aug 12, 2017
268
views
tbb-toc-2
theory-of-computation
regular-expression
2
votes
3
answers
54
Test by Bikram | Theory of Computation | Test 2 | Question: 7
Consider the following regular languages: $L_1$: Languages that accept strings over $\Sigma = \{a, b\}$, such that length of string is greater than $1$, but multiple of $3$. $L_2$: Languages that accept strings over $\Sigma = \{a, b\}$, such ... ? $s_1 = s_2 < s_3$ $s_1 = s_3 < s_2$ $s_1 < s_2 < s_3$ $s_1 < s_3 < s_2$
asked
in
Theory of Computation
Aug 12, 2017
617
views
tbb-toc-2
theory-of-computation
minimal-state-automata
1
vote
1
answer
55
Test by Bikram | Theory of Computation | Test 2 | Question: 6
How many states does the Minimal Finite Automata that accepts all strings of $x$'s and $z$'s (where the number of $x$'s is at least $L$) contain? $L$ states $(L+1)$ states $(L+2)$ states $(L+3)$ states
asked
in
Theory of Computation
Aug 12, 2017
258
views
tbb-toc-2
minimal-state-automata
theory-of-computation
3
votes
2
answers
56
Test by Bikram | Theory of Computation | Test 2 | Question: 5
Given two regular expressions: $p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$ The length of the smallest string that is present in the language corresponding to regular expression ‘$p$’ and not present in the language corresponding to regular expression ‘$q$’ is ________.
asked
in
Theory of Computation
Aug 12, 2017
688
views
tbb-toc-2
numerical-answers
theory-of-computation
regular-expression
0
votes
1
answer
57
Test by Bikram | Theory of Computation | Test 2 | Question: 4
Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages.
asked
in
Theory of Computation
Aug 12, 2017
442
views
tbb-toc-2
theory-of-computation
closure-property
p-np-npc-nph
1
vote
1
answer
58
Test by Bikram | Theory of Computation | Test 2 | Question: 3
Consider the following input sequence $010101\dots$ ($01$ repeated one or more times). The minimum number of states required in a DFA to accept the strings following the above pattern is _________.
asked
in
Theory of Computation
Aug 12, 2017
614
views
tbb-toc-2
numerical-answers
theory-of-computation
minimal-state-automata
1
vote
1
answer
59
Test by Bikram | Theory of Computation | Test 2 | Question: 2
Which of the following is correct? $(01)^* \cap (10)^* = \phi$ $(a + b + c)^* = a^*b^*c^* + a^*b^* + c^* + c^*a^*b^*$ $(p + q)^* p + (p + q)^* q + \epsilon = (p^* q^*)^*$ $( y + z)^* \cap (y + z)^* yz \neq ( y + z)^* yz$
asked
in
Theory of Computation
Aug 12, 2017
688
views
tbb-toc-2
theory-of-computation
regular-expression
4
votes
1
answer
60
Test by Bikram | Theory of Computation | Test 2 | Question: 1
Choose the appropriate context-free language $L_2$ that ensure that $L_1 \cap L_2$ is NOT context-free, where $L_1 = \{x^ny^m z^m \mid m > 0, n > 0 \}$: $L_2 = \{x^n y^n z^{2m} \mid n > 0, m > 0 \}$ $L_2 = \{x^n y^m z^p \mid n > m \text{ and } m > p \}$ $L_2 = \{x^n y^n z^n \mid n > 0 \}$ Both (A) and (B)
asked
in
Theory of Computation
Aug 12, 2017
796
views
tbb-toc-2
theory-of-computation
context-free-language
Page:
« prev
1
2
3
4
5
6
7
8
...
43
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...