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 aditi19
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by aditi19
1
vote
2
answers
41
Virtual Gate Test Series: Theory Of Computation - Languages
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ is Regular Recursive but not context free Context Free but not regular None of the above
asked
in
Theory of Computation
Mar 24, 2019
634
views
theory-of-computation
identify-class-language
virtual-gate-test-series
1
vote
3
answers
42
Turing Machine Self Doubt
Can someone explain in details how set of all TM is countable?
asked
in
Theory of Computation
Mar 23, 2019
607
views
turing-machine
theory-of-computation
counting
set-theory
0
votes
0
answers
43
Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no-207)
Design grammar for the language- set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct? S->A | 01S A->1AS | ε
asked
in
Compiler Design
Mar 22, 2019
581
views
theory-of-computation
compiler-design
context-free-grammar
0
votes
1
answer
44
Set Theory Self Doubt
Is the subset of a countably infinite set countable?
asked
in
Set Theory & Algebra
Mar 19, 2019
225
views
1
vote
1
answer
45
Ullman Exercise
What language is generated by the following grammer? S→ a | S+S | SS | S* | (S)
asked
in
Compiler Design
Mar 19, 2019
459
views
compiler-design
context-free-grammar
0
votes
0
answers
46
Virtual GATE
Let A be a regular set. Consider the two sets below L1={x | $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$} L2={x | $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$} which of the following statements is true? L1 and L2 both are regular L1 is regular but L2 is not L1 is not regular but L2 is L1 and L2 both are non-regular
asked
in
Theory of Computation
Mar 17, 2019
503
views
virtual-gate
test-series
theory-of-computation
regular-language
regular-expression
1
vote
1
answer
47
CFG Doubt
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this?
asked
in
Theory of Computation
Mar 7, 2019
886
views
context-free-language
theory-of-computation
context-free-grammar
0
votes
1
answer
48
CFG Doubt
S->A | B A→ ε B->aBb B->b what is the complement of the language of this grammar?
asked
in
Theory of Computation
Mar 2, 2019
838
views
context-free-language
theory-of-computation
context-free-grammar
0
votes
1
answer
49
Peter Linz Edition 4 Exercise 5.1 Question 13.a (Page No. 134)
L={$a^nb^n | n\geq 0$} please show how $L^2$ is CFL
asked
in
Theory of Computation
Mar 1, 2019
417
views
theory-of-computation
peter-linz
peter-linz-edition4
context-free-language
context-free-grammar
1
vote
1
answer
50
Peter Linz Edition 4 Exercise 4.3 Question 6 (Page No. 122)
Given $L_1=${$a^nb^n$|$n\geqslant 1$} , $L_2=${$a^nb^m|n\geq 1, m\geq 1$}, $L_3=${$a^nb^{n+2}|n\geqslant 1$} if $L_1 \cup L_2$ is regular then why $L_1 \cup L_3$ is not regular? also what is the language of $L_1 \cup L_3$?
asked
in
Theory of Computation
Feb 25, 2019
975
views
theory-of-computation
peter-linz
peter-linz-edition4
regular-language
pumping-lemma
2
votes
1
answer
51
Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
what is the regular grammar for L={$a^nb^m$ | n+m is even}
asked
in
Theory of Computation
Feb 24, 2019
944
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-expression
regular-grammar
1
vote
0
answers
52
Peter Linz Edition 4 Exercise 3.3 Question 6 (Page No. 97)
Construct a right linear grammar for the language $L((aab^*ab)^*)$ is this grammar correct? S->aaA | ε A->bA | abA | S
asked
in
Theory of Computation
Feb 24, 2019
528
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-grammar
2
votes
2
answers
53
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
asked
in
Theory of Computation
Feb 22, 2019
929
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-expression
0
votes
1
answer
54
Pipeline
A pipelined Processor contains 5 instructions stages of execution times 120ns, 160ns, 105 ns, 135ns and 155ns with a register delay 10ns on each stage. What is the percentage of performance increased with 1000 instructions instead of 10 instructions
asked
in
CO and Architecture
Dec 18, 2018
2.0k
views
pipelining
co-and-architecture
0
votes
2
answers
55
AAI JE IT 2018
Suppose x and y are floating-point variables that have been assigned the values x=8.8 and y=3.5. what will be the value of the following expression? 2*x/3*y
asked
in
Programming in C
Dec 18, 2018
1.0k
views
aai
expression-evaluation
0
votes
0
answers
56
Channel Utilization
Consider a LAN with 500 stations connected to five 500 m segments. The data rate is 10 Mbps and slot time is 51.2 micro sec, If all the stations transmit With equal probability what is the channel utilization using a frame size of 512 bytes? Note-Number of contention slots are 1.716 how to proceed with these kind of questions?
asked
in
Computer Networks
Dec 16, 2018
2.0k
views
computer-networks
ethernet
0
votes
2
answers
57
Kenneth Rosen Edition 6th Exercise 7.1 Question 23 (Page No. 458)
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
asked
in
Combinatory
Dec 14, 2018
468
views
kenneth-rosen
discrete-mathematics
recurrence-relation
0
votes
1
answer
58
Doubt UGC NET
https://gateoverflow.in/13365/ugcnet-dec2014-iii-24 i’ve a small doubt in the solution of this question how is (a+b)*ba(a+b)* complement of the given language?
asked
in
Theory of Computation
Dec 14, 2018
967
views
regular-language
regular-grammar
query
1
vote
2
answers
59
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
asked
in
Theory of Computation
Dec 14, 2018
1.5k
views
finite-automata
theory-of-computation
0
votes
2
answers
60
Minimal DFA
Given following NFA find the minimal equivalent DFA
asked
in
Theory of Computation
Dec 14, 2018
1.6k
views
theory-of-computation
minimal-state-automata
number-of-states
finite-automata
Page:
« prev
1
2
3
4
5
6
7
8
9
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:...