Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged #toc
0
votes
0
answers
Made easy work book toc
Why aa*(bb*a)* not a regular expressian for starting and ending with symbol A Dfa
asked
1 day
ago
in
Theory of Computation
by
Ritesh123
(
6
points)

7
views
madeeasyworkbook
#toc
0
votes
0
answers
Automata  DFA
In what cases we need to include epsilon in DFA.
asked
Feb 18
in
Theory of Computation
by
pppankajsaini
(
8
points)

6
views
#dfa
theoryofcomputation
#toc
+1
vote
0
answers
Turing Machine
As per the definition of a Turing Machine, it does not accept Epsilon. But, A → ϵ can be generated by a Unrestricted Grammar. So, how can we say that Turing Machines are the acceptors for Recursively Enumerable languages generated by Unrestricted Grammar?
asked
Feb 13
in
Theory of Computation
by
Joon88
(
7
points)

14
views
#toc
turingmachine
theoryofcomputation
grammar
unrestrictedgrammar
+1
vote
0
answers
TOC(self doubt)
How is the complement of $L=\{ww w \epsilon(a+b)^*\}$ is $CFL$
asked
Feb 5
in
Theory of Computation
by
Pratyush Priyam Kuan
(
803
points)

19
views
theoryofcomputation
#closureproperties
#toc
0
votes
0
answers
Applied course test series : Turing machine
Can someone explain statement I. My doubt is that if the language is accepted and rejected both by turing machine then it is decidable language which also recognized by Turing machine. So statement I should be false ,right?
asked
Jan 29
in
Theory of Computation
by
vishal burnwal
(
135
points)

66
views
#toc
0
votes
0
answers
SELF DOUBT: PREVIOUS GO COMPILERS
How to solve these types of questions quickly? is there any algorithm?
asked
Jan 23
in
Theory of Computation
by
Debapaul
(
698
points)

23
views
#toc
0
votes
0
answers
made easy test series DPDA doubt
asked
Jan 23
in
Theory of Computation
by
Dheeraj Varma
(
22
points)

11
views
madeeasytestseries
#toc
#pda
0
votes
0
answers
made easy test series DPDA doubt
Why II. is invalid??
asked
Jan 23
in
Theory of Computation
by
Dheeraj Varma
(
22
points)

11
views
madeeasytestseries
#toc
#pda
0
votes
0
answers
Gate 1992 Question
In which of the cases stated below is the following statement true? “For every nondeterministic machine M1, there exists an equivalent deterministic machine M2 recognizing the same language“. (a) M1 is a nondeterministic finite automaton (b) M1 is a nondeterministic PDA (c) M1 is a nondeterministic Turing machine (d) For no machine M1 use the above statement true
asked
Jan 20
in
Theory of Computation
by
veenashiva18
(
7
points)

5
views
#toc
#turingmachine
0
votes
0
answers
Self Doubt #regular languages
What is PHI in Finite Machine representation, is it an isloated state ? , and how come the below is true ∅ ∗ = epsilon
asked
Jan 20
in
Theory of Computation
by
dr_Jackal
(
16
points)

4
views
#toc
#regularexpression
+1
vote
0
answers
ME CBT How is "A" regular?
asked
Jan 17
in
Theory of Computation
by
toxicdesire
(
229
points)

30
views
madeeasytestseries
#toc
0
votes
1
answer
Consider L = {a^n b^n c^n n ≥ 0}. Is L'(L Complement) a CFL? Prove it.
asked
Jan 16
in
Theory of Computation
by
bankeshk
(
12
points)

22
views
#toc
contextfreelanguage
#testseries
0
votes
0
answers
Madeeasy test series  How many lookaheads are present?
asked
Dec 31, 2019
in
Compiler Design
by
luc_Bloodstone
(
36
points)

12
views
madeeasytestseries
compilerdesign
#toc
0
votes
1
answer
Self Doubt TOC Decidability
L = { M  M is TM and L(M) is infinite. This is not recursive but is this semi decidable or Not?
asked
Dec 30, 2019
in
Theory of Computation
by
tp21
(
269
points)

22
views
#toc
decidability
0
votes
1
answer
Self doubt on identify language
What is a^m b ^ n where m* n= p ?
asked
Dec 28, 2019
in
Theory of Computation
by
Winner
(
73
points)

35
views
#toc
0
votes
0
answers
Madeeasy Test Series  SSA form
Doubt : In solution they used a variable more than once in LHS but in SSA form I think we always use new variable in LHS. Solution they have given:
asked
Dec 25, 2019
in
Compiler Design
by
luc_Bloodstone
(
36
points)

18
views
madeeasytestseries
compilerdesign
#toc
0
votes
1
answer
Self dount TOC
1. Complement of RE which is not REC is __ 2. Complement of RE which is also REC is __
asked
Dec 24, 2019
in
Theory of Computation
by
Chirag Shilwant
(
180
points)

16
views
#toc
theoryofcomputation
#closureproperties
recursive
0
votes
0
answers
DFA/NFA MINIMUM NUMBER OF STATES
How to decide minimum when will DFA have N+2 or N+1 states? https://gateoverflow.in/39562/gate2016216 https://gateoverflow.in/8256/gate2015253 https://gateoverflow.in/118302/gate2017122 https://gateoverflow.in/118160/gate2017225 above 2 are cases for N+1 and latter are N+2
asked
Dec 6, 2019
in
Theory of Computation
by
Asim Siddiqui 4
(
8
points)

6
views
theoryofcomputation
finiteautomata
#dfa
#toc
0
votes
0
answers
String acceptance in PDA
In PDA is it okay that stack is not empty but string reached the final state? Can we accept such string?
asked
Dec 2, 2019
in
Theory of Computation
by
luc_Bloodstone
(
36
points)

13
views
theoryofcomputation
#toc
pushdownautomata
0
votes
1
answer
Self doubt on a Decidability question
For arbitrary CFG G and arbitrary regular expression R, whether L(R)$\subseteq $L(G) is DECIDABLE ?
asked
Nov 18, 2019
in
Theory of Computation
by
pranay562
(
926
points)

21
views
#toc
#decidability
0
votes
0
answers
SelfDoubt: GATE questions
https://gateoverflow.in/302841/gate20197 Can anyone give some example, to show where is difference between option A) and B)?
asked
Nov 18, 2019
in
Theory of Computation
by
srestha
(
679
points)

22
views
#toc
0
votes
0
answers
REGULAR EXPRESSIONS SELF DOUBT
Through which transformations I could prove that RE (a+b+c)* is equivalent to (a*b*+c*)* ,I tried some transformations on (a+b+c)* but getting this ((a*b*)*+c*)*
asked
Nov 16, 2019
in
Theory of Computation
by
codingo1234
(
7
points)

17
views
#toc
0
votes
0
answers
Self doubt on decidability in pda
Why checking whether 2 pdas equal or not is undecidable?
asked
Nov 15, 2019
in
Theory of Computation
by
Winner
(
73
points)

23
views
#toc
0
votes
1
answer
TOC questions
Give brief ans
asked
Nov 14, 2019
in
Theory of Computation
by
amit166
(
139
points)

39
views
#toc
0
votes
1
answer
CS_GATE_2020_07 ( TOC )
asked
Nov 9, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

28
views
#toc
0
votes
0
answers
Self doubt (T O C)
A grammar can be ambiguous if it represents NonDeterministic Model.
asked
Nov 8, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

10
views
#toc
0
votes
1
answer
Self Doubt (T.o.c)
What is Minimal dfa for → (0*1+1*)
asked
Nov 8, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

29
views
#dfa
#toc
0
votes
0
answers
Some gate questions (TOC)
A is recursive if both A and its complement are accepted by Turing Machine. True or false ?
asked
Nov 7, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

13
views
#toc
#recursive
0
votes
1
answer
Self doubt on toc
How $w.(w^r)^*$ is regular ? I mean we got ($w \cup w.w^r$ like that ) the second portion $w.w^r$ is cfl ,then how can it be regular? where $w$ can be anything
asked
Nov 3, 2019
in
Theory of Computation
by
Winner
(
73
points)

11
views
#toc
0
votes
0
answers
TOCself doubt
Are both pushdownnautomata correct?
asked
Nov 2, 2019
in
Theory of Computation
by
Ekta07_GATE
(
22
points)

15
views
#toc
#pda
#cfl
0
votes
1
answer
selfdoubt on languages(TOC)
Could anybody please tell me the correct language for each of them and also the procedure to check. $ \left \{a^{m}b^{n}  m+n=100\right \}$ $ \left \{a^{m}b^{n}  mn=100\right \}$ $ \left \{a^{m}b^{n}  m\times n=100\right \}$ $ \left \{a^{m}b^{n}  m/n=100\right \}$ $ \left \{a^{m}b^{n}  m+n>=100\right \}$ $ \left \{a^{m}b^{n}  m\times n>=100\right \}$
asked
Nov 1, 2019
in
Theory of Computation
by
chandrikabhuyan8
(
120
points)

31
views
#toc
0
votes
1
answer
Self doubt on prefixes in toc
What could be the set of prefixes for the language (a+b)* ,and will this set be regular?
asked
Nov 1, 2019
in
Theory of Computation
by
Winner
(
73
points)

11
views
#toc
0
votes
1
answer
SuccessGateway Test Series
State true or false with explanation. The answer to this is given as True and explanation as follows: L is universal language over alphabet a,b. As far as I know this should be non regular and I don’t understand the logic that L is universal language. Please confirm what should be the correct answer.
asked
Nov 1, 2019
in
Theory of Computation
by
SpringPearl
(
6
points)

19
views
#toc
#testseries
0
votes
0
answers
Self doubt toc string matching
How $xww^{R}$ is cfl if w belongs to $(0+1)^{+}$ and $x$ can be anything ?
asked
Oct 31, 2019
in
Theory of Computation
by
Winner
(
73
points)

18
views
#toc
0
votes
0
answers
Self doubt (TOC)
What will be Grammar for this Language given?
asked
Oct 23, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

12
views
#toc
#grammar
0
votes
3
answers
Self doubt TOC
What is the regular expression for this given DFA?
asked
Oct 20, 2019
in
Theory of Computation
by
Priyansh Singh
(
257
points)

68
views
#toc
#regularexpression
0
votes
0
answers
Is this a Regular language or not?
Here ‘w^r’ is the reverse of string ‘w’.
asked
Oct 18, 2019
in
Theory of Computation
by
luc_Bloodstone
(
36
points)

18
views
#toc
theoryofcomputation
#regularlanguage
regularlanguages
regulargrammar
0
votes
0
answers
MADE EASY TOC 2020
L1 CSL, L2 CFL L1 CSL, L2 CSL L1 CFL, L2 CFL L1 CFL, L2 CSL
asked
Oct 17, 2019
in
Theory of Computation
by
Debapaul
(
698
points)

37
views
#toc
0
votes
0
answers
Self Doub in finding the substring.
The number of substrings of length $\le3$ generated by the regular expression $\mathrm {(a+ba)^*b(a+b)^*}$ is___________________. I am getting $15$ as the answer.
asked
Oct 13, 2019
in
Theory of Computation
by
`JEET
(
179
points)

18
views
#toc
substring
0
votes
1
answer
Ace booklet question on dfa
The minimal finite automata for the set of all strings over $(0+1+2)^*$ that interpreted as integer representation of a base 3 number as congruent to 5 modulo 6 has a) 5 b) 6 c) 7 d) none I am getting $6$ but the answer given is none of these.
asked
Oct 12, 2019
in
Theory of Computation
by
`JEET
(
179
points)

34
views
#dfa
#toc
#dfadesign
Page:
1
2
3
next »
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Feb 2020
shashin
363 Points
Shaik Masthan
79 Points
SuvasishDutta
39 Points
srestha
33 Points
Mk Utkarsh
32 Points
neeraj_bhatt
31 Points
!KARAN
30 Points
Debapaul
23 Points
Pratyush Priyam Kuan
18 Points
kalra05
18 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,338
questions
1,582
answers
10,283
comments
89,934
users