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 rballiwal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by rballiwal
0
votes
1
#GRAPH THEORY
A simple regular graph n vertices and 24 edges, find all possible values of n.
answered
in
Graph Theory
Jun 4, 2019
2.6k
views
graph-theory
1
vote
2
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
answered
in
Graph Theory
Jun 4, 2019
1.3k
views
simple-graph
1
vote
3
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
answered
in
Graph Theory
Jun 4, 2019
2.1k
views
graph-theory
discrete-mathematics
0
votes
4
self-doubt
A graph with alternating edges and vertices is called a walk (we can repeat the number of vertices and edges any number of times) . A walk in which no edges are repeated is called a trial. A trial in which no vertices are repeated is called a path. A trial in which only the starting and ending vertices are repeated is called a circuit. Are the definitions correct??
answered
in
Graph Theory
Jun 4, 2019
652
views
graph-theory
0
votes
5
regular expression for mod 3 =1
someone can help me found the regular expression of L={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
answered
in
Theory of Computation
Dec 30, 2018
2.8k
views
regular-expression
2
votes
6
DFA doubt
let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n? a)1 b)2 c)3 d)4 e)there not fixed
answered
in
Theory of Computation
Dec 30, 2018
891
views
0
votes
7
Madeasy test series
Does equivalence of CFG decidable ? That is for two CFG G1 and G2 L(G1)= L(G2)? And if it is DCFG than is it decidable.
answered
in
Theory of Computation
Dec 30, 2018
509
views
decidability
theory-of-computation
context-free-language
recursive-and-recursively-enumerable-languages
0
votes
8
UGC NET CSE | December 2018 | Part 2 | Question: 31
Let $r=a(a+b)^*, \: s=aa^*b$ and $t=a^*b$ be three regular expressions. Consider the following : $L(s) \subseteq L(r )\text{ and } L(s) \subseteq L(t)$ ... Choose the correct answer from the code given below : Only i is correct Only ii is correct Both i and ii are correct Neither i nor ii is correct
answered
in
Unknown Category
Dec 30, 2018
1.4k
views
ugcnetcse-dec2018-paper2
0
votes
9
Self doubt
Unrestricted grammar generate Recursive enumerable language. Am i right??
answered
in
Theory of Computation
Dec 17, 2018
273
views
1
vote
10
self doubt - Turing Machines
I have doubt in the following question: Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by CFG G. Let L(M) be the language accepted by a turing machine M. Now, I am getting confused over the keyword “accepted”. What should L(M) be considered? Is it REC or RE?
answered
in
Theory of Computation
Dec 17, 2018
318
views
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
0
votes
11
Self Doubt regarding Type 1
L= a*b* Grammar associated with this language is a Type 3 S---> aS/A A--->bA/€ Now we know that Type 1 Grammar is Non Contracting Grammar Here A---> € is a Contracting production And only S---> € is allowed in Type 1 And if a grammar is not type 1 how it can be type 3 ? Please help
answered
in
Theory of Computation
Dec 17, 2018
311
views
0
votes
12
Question on P problem
I think answer should be D. they have given wrong answer. Please correct me if I am wrong.
answered
in
Theory of Computation
Dec 16, 2018
357
views
theory-of-computation
0
votes
13
Context free language Question
please provide solution for given quesion.
answered
in
Theory of Computation
Dec 16, 2018
291
views
context-free-language
theory-of-computation
0
votes
14
pushdown automata
What is the difference between DPDA which accept Language by the empty stack and the one which accepts by final state
answered
in
Theory of Computation
Dec 16, 2018
527
views
0
votes
15
Halting problem of TM which recognize recursive languages is undecidable?
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)
answered
in
Theory of Computation
Dec 16, 2018
1.7k
views
decidability
recursive-and-recursively-enumerable-languages
theory-of-computation
turing-machine
rice-theorem
0
votes
16
Turing Machine lecture content stan..
A = { <M,w> | M is a TM that accepts W} what is A’( A complement)? Pls guide : M is a Tm doesn,t accept w, Unable to approach further Source:https://web.stanford.edu/class/archive/cs/cs103/cs103.1134/lectures/20/Small20.pdf
answered
in
Theory of Computation
Dec 16, 2018
324
views
turing-machine
decidability
0
votes
17
recursive language
Can a language exist which is undecidable as well as Recursive language ? If yes please give example.
answered
in
Theory of Computation
Dec 15, 2018
992
views
recursive-and-recursively-enumerable-languages
0
votes
18
Countable set
If power set of natural number is uncountable , and that is why non RE, then how is it possible set of natural number is countable and RE?------give some reason
answered
in
Theory of Computation
Dec 14, 2018
764
views
theory-of-computation
1
vote
19
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n> 0 } L = {a^nb^n | n < 1000 } L = {a^nb^k | n is odd or k is even } L = {wxw^R | w,x ∈(0+1)* } 1, 3 and 4 2, 3, 4 2, 3 1, 2, 3, 4
answered
in
Theory of Computation
Dec 14, 2018
1.1k
views
context-sensitive
regular-language
context-free-language
theory-of-computation
regular-expression
0
votes
20
Turing Machine-Techtud
If Turing Machine input tape length,restricted to input length, then the language accepted by Turing Machine $A)$ Regular Language $B)$ CFL $C)$ CSL $D)$ None Ans given CSL but I thought it should be regular then what is difference between input restricted and constant size tape? https://gateoverflow.in/26653/gate1991-17-a Plz confirm what is correct?
answered
in
Theory of Computation
Dec 14, 2018
1.4k
views
turing-machine
theory-of-computation
0
votes
21
UGC NET CSE | June 2016 | Part 3 | Question: 55
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation $R_M$ defined by M as all states that are reachable from the start state. $R_M$ has ___ equivalence classes. 2 4 5 6
answered
in
Theory of Computation
Dec 14, 2018
7.3k
views
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
regular-language
0
votes
22
Minimal DFA
Given following NFA find the minimal equivalent DFA
answered
in
Theory of Computation
Dec 14, 2018
1.6k
views
theory-of-computation
minimal-state-automata
number-of-states
finite-automata
0
votes
23
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
answered
in
Theory of Computation
Dec 14, 2018
1.6k
views
finite-automata
theory-of-computation
1
vote
24
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
answered
in
Theory of Computation
Dec 14, 2018
1.6k
views
theory-of-computation
number-of-states
minimal-state-automata
0
votes
25
ME Test Series
I know compleiment of CSL is CSL so can anyone explain how to solve these type of problems effectively by saving time.
answered
in
Theory of Computation
Dec 14, 2018
550
views
0
votes
26
ME Test Series
Can anyone explain?
answered
in
Theory of Computation
Dec 14, 2018
312
views
0
votes
27
What is the difference between a*+b* and (a+b)* ?
answered
in
Theory of Computation
Dec 14, 2018
2.9k
views
theory-of-computation
1
vote
28
Introduction to computer theory
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
answered
in
Theory of Computation
Nov 12, 2018
1.0k
views
theory-of-computation
finite-automata
dpda
0
votes
29
pumping lemma
to check if a given language is regular or not, for this i have seen many solutions on the net and lectures but everyone has used a direct approach to determine that but in the standard textbooks the method for doing this is given as pumping lemma which i ... new question and i don't know the concept to solve it. which one should i do, pumping lemma or the direct approach one?
answered
in
Theory of Computation
Nov 12, 2018
489
views
Page:
1
2
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:...