menu
Recent questions tagged toc-languages
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged toc-languages
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged toc-languages
0
votes
0
answers
39
views
Gate applied
Can some one please do a pumping lema on L = {a^(2n+1) | n>=0 } I know Finite automata can be easily made and hence it is a regular language, but the pumping lema test fails for this implying it is a non-regular language (I am sure I am doing the pumping lema wrong) can someone please do a pumping lema for this so that I compare my solution and rectify my mistake
pavan.varyani
asked
in
Theory of Computation
Dec 7, 2021
by
pavan.varyani
5
points
39
views
toc-languages
regular-expressions
pumping-lemma
0
votes
1
answer
85
views
TOC - Regular Expressions
As for a Finite Automata, we say a finite automata accepts a language if it accepts all strings present in the language as well as REJECTS all strings which are not present in the language. Is the definition for a regular language the same as that ... all strings of the regular language as well as NOT represent any strings not part of the language ?? Pls clear this.
Rutuja Desai
asked
in
Theory of Computation
Oct 27, 2021
by
Rutuja Desai
5
points
85
views
toc-languages
regular-expressions
self-doubt
regular-languages
0
votes
1
answer
76
views
Gate Academy toc self douht
Caption I draw a DFA of given language.is it true or false? If i false then send me right one.
Enolx.21
asked
in
Theory of Computation
Sep 8, 2021
by
Enolx.21
53
points
76
views
toc-languages
nfa-dfa
0
votes
1
answer
73
views
applied gate test
how many states are in smallest possible DFA {0,1} * {$1^{10}$}
Nilabja Sarkar
asked
in
Theory of Computation
Aug 30, 2021
by
Nilabja Sarkar
5
points
73
views
toc-languages
regular-expressions
0
votes
0
answers
195
views
Countability in toc
Hi What is best resource and Where to study countability topic in toc?
ykrishnay
asked
in
Theory of Computation
Aug 21, 2021
by
ykrishnay
103
points
195
views
self-doubt
finite-automata
toc-languages
theory-of-computation
0
votes
0
answers
39
views
How to design Turing machine for addition of 2 binary numbers
ykrishnay
asked
in
Theory of Computation
Aug 18, 2021
by
ykrishnay
103
points
39
views
turing-machine
self-doubt
compiler-design
toc-languages
finite-automata
1
vote
0
answers
53
views
complement of language
How to find complement of language.? complement of recursive language is recursive. while complement of context free language is context sensitive language.
TheShivam
asked
in
Theory of Computation
Aug 16, 2021
by
TheShivam
9
points
53
views
self-doubt
toc-languages
regular-languages
context-free-languages
turing-machine
0
votes
0
answers
45
views
Regular Grammar
Is S--> AccB A-->aA/a B-->bB/a a regular grammar according to the type 3 grammar rule i.e, production must be in the form S-->Ax or S-->xA where A is non terminal and x is terminal?
Shubhranshu
asked
in
Theory of Computation
Aug 1, 2021
by
Shubhranshu
5
points
45
views
toc-languages
regular-languages
regular-grammar
0
votes
0
answers
35
views
Clear distinction between Finite automata, Regular expressions
akshansh
asked
in
Theory of Computation
Jun 12, 2021
by
akshansh
15
points
35
views
toc-languages
regular-expressions
nfa-dfa
0
votes
0
answers
59
views
NPTEL(Theory of Computation )
How is the regular expression (0+1)*0(0+1)*1(0+1)* is equivalent to (0+1)*01(0+1)* ?
hrtoimukra
asked
in
Theory of Computation
Jun 9, 2021
by
hrtoimukra
5
points
59
views
toc-languages
0
votes
1
answer
22
views
#Self_Doubt #NFA
For any given NFA with ip_set = {a,b} if any transaction is Missing then can we assume a Self Loop ? For example, [T1] a b [T2] a b S S,P Q S S,P Q is P _ Q same as P P Q Q* _ _ Q* Q Q Notice in T1 for transaction(P,a) = undefined. So can we assume transaction(P,a) = P ?
Palash_292
asked
in
Theory of Computation
May 18, 2021
by
Palash_292
5
points
22
views
self-doubt
toc-languages
0
votes
0
answers
28
views
$r^+$ and $r^*$doubt from TOC[self doubt]
if $r= a+epsilon$, then the $r^+$ and $r^*$ will be same right? in a question i was solving it is asked, $r^*=r^+$ if and only if $r=epsilon$. Is this true or false as i have written an example above where $r^*$ and $r^+$ will be same.
rythmrana
asked
in
Theory of Computation
May 16, 2021
by
rythmrana
5
points
28
views
toc-languages
1
vote
0
answers
42
views
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a left-linear grammar for the language S→ abA A → baB B → aA | bb.
Setsu
asked
in
Theory of Computation
May 3, 2021
by
Setsu
13
points
42
views
peter-linz
toc-languages
peterlinz
1
vote
0
answers
23
views
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a left-linear grammar for the language S→ abA A → baB B → aA | bb.
Setsu
asked
in
Theory of Computation
May 3, 2021
by
Setsu
13
points
23
views
peter-linz
toc-languages
peterlinz
0
votes
0
answers
42
views
Ullman,rozen
Levi Ackerman: Is L= {xwywr∣x, w,y∈(a+b) +} regular? wr is reverse of w
Gogo6996
asked
in
Theory of Computation
May 2, 2021
by
Gogo6996
5
points
42
views
toc-languages
0
votes
0
answers
36
views
DFA construction
For E={a,b} construct a dfa for language L where L={w | w has a b in its 2nd last position if such a position exists}????
harshit_1010
asked
in
Theory of Computation
May 2, 2021
by
harshit_1010
5
points
36
views
dfas
toc-languages
0
votes
0
answers
21
views
#DFA Introduction, Formal Languages, DFA Construction examples
DarkShadow18
asked
in
Theory of Computation
Apr 10, 2021
by
DarkShadow18
5
points
21
views
toc-languages
0
votes
0
answers
43
views
AppliedGate lecture example
What is the NFA that does not accept strings ending “101” ?
shri385
asked
in
Theory of Computation
Apr 7, 2021
by
shri385
5
points
43
views
nfa-dfa
toc-languages
finite-automata
0
votes
0
answers
47
views
PDA for a^nb^n/n>=1
Is this PDA correct for a^n. B^n/n>=1?
jaswanth431
asked
in
Theory of Computation
Mar 4, 2021
by
jaswanth431
5
points
47
views
toc-languages
2
votes
1
answer
51
views
Self Doubt on Theory of Computation
What is the intersection of recursive and recursively enumerable language?
samir757
asked
in
Theory of Computation
Mar 4, 2021
by
samir757
29
points
51
views
turing-machine
toc-languages
self-doubt
0
votes
1
answer
71
views
Context Free Languages (Self Doubt)
I understand that the language L = {a^m b^n c^k|(m=n)or(n=k)} is CFL because it can be represented as the union of L1 = {a^m b^m c^k} and L2 = {a^m b^k c^k} which are both CFL's. But I can't figure out the working of the PDA accepting L. To check ... meaning (m=n) or (m-n) a's or (n-m) b's will remain in the stack meaning (m!=n). How can we check for (n=k) now?
shantanu4raje
asked
in
Theory of Computation
Feb 6, 2021
by
shantanu4raje
25
points
71
views
toc-languages
self-doubt
0
votes
0
answers
55
views
made easy test series
Answer given is “All of these” My answer is none of these are regular.
rahul65
asked
in
Theory of Computation
Feb 3, 2021
by
rahul65
5
points
55
views
toc-languages
0
votes
0
answers
159
views
TOC Made easy
Consider the grammar consisting of seven productions. S → aA | aBB A → aaA | λ B → bB | bbC C → B After elimination of unit, useless, and λ -productions how many productions remain in the resulting grammar ? 2 3 4 5
kirtipurohit
asked
in
Theory of Computation
Feb 2, 2021
by
kirtipurohit
15
points
159
views
test-series
toc-languages
0
votes
0
answers
76
views
Gate Overflow itself
Is the explanation is correct? Link-https://gateoverflow.in/33183/complement-of-csl If I say complement of $a^{n}b^{n}c^{n} \, \, \, \, \, \, is\, \, \, \, \, a^{n}b^{n}c^{m} \: \: and\: \: \: m\neq n$ Then How Can it be regular?
RavGopal
asked
in
Theory of Computation
Feb 1, 2021
by
RavGopal
145
points
76
views
toc-languages
0
votes
0
answers
74
views
self doubt - decidability
L={<M>| M is a TM that accepts all even numbers}. How to check whether it is RE, REC or not RE… I think Rice’s theorem 2nd part is not applicable here
Abhineet Singh
asked
in
Theory of Computation
Feb 1, 2021
by
Abhineet Singh
23
points
74
views
decidability
toc-languages
1
vote
0
answers
69
views
Recursive Languages Self Doubt
Is recursive language closed under positive closure?
aditi19
asked
in
Theory of Computation
Jan 29, 2021
by
aditi19
59
points
69
views
toc-languages
0
votes
0
answers
60
views
Madeeasy Test series TOC Q1
Shivateja MST
asked
in
Theory of Computation
Jan 23, 2021
by
Shivateja MST
45
points
60
views
toc-languages
0
votes
0
answers
28
views
An introduction to formal languages and automata
How can I explain that this language- L= { a<sup>n</sup> b<sup>l</sup> : n ≠ l } is not regular. [USE PUMPING LEMMA OR CLOSURE PROPERTIES] This question is under a book named An introduction to ... understandable manner and show how you exactly arrived at the solution? That would be a great help to me. Thanks in advance
kirtipurohit
asked
in
Theory of Computation
Jan 18, 2021
by
kirtipurohit
15
points
28
views
toc-languages
peter-linz
grammar
dfas
pumping-lemma
0
votes
1
answer
53
views
Show that the language S-> aSS| b is not regular ?
kirtipurohit
asked
in
Theory of Computation
Jan 18, 2021
by
kirtipurohit
15
points
53
views
toc-languages
peterlinz
0
votes
0
answers
92
views
An introduction to formal languages and automata peter linz
kirtipurohit
asked
in
Theory of Computation
Jan 16, 2021
by
kirtipurohit
15
points
92
views
toc-languages
peter-linz
grammar
dfas
nfa-dfa
0
votes
0
answers
24
views
Peter Linz 5e Ex-2.1 Q-7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }
aditi19
asked
in
Theory of Computation
Jan 14, 2021
by
aditi19
59
points
24
views
peter-linz
toc-languages
dfas
1
vote
0
answers
44
views
Peter Linz 5e Ex-2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)-n_{b}(w))mod3>0$ }
aditi19
asked
in
Theory of Computation
Jan 14, 2021
by
aditi19
59
points
44
views
peter-linz
toc-languages
dfas
0
votes
1
answer
48
views
Applied Test Series TOC
Options: My answer was: D answer according to them was B and D and their explaination was
Nitinkumar.097
asked
in
Theory of Computation
Jan 4, 2021
by
Nitinkumar.097
13
points
48
views
test-series
toc-languages
0
votes
0
answers
43
views
GATE 2003 , Theory Of Computation , Turing Machine
Pushkar Khadase
asked
in
Theory of Computation
Jan 4, 2021
by
Pushkar Khadase
5
points
43
views
toc-languages
turing-machine
0
votes
3
answers
82
views
youtube exercise unacademy
L1=a^n,,n>0 L2=a^n b^n c^n , n>0 L1.L2 is a)regular b)cfl c)csl d)none
tvs6
asked
in
Theory of Computation
Dec 30, 2020
by
tvs6
5
points
82
views
toc-languages
0
votes
2
answers
75
views
TOC- closure properties of RL
let L1=a^n (which is a regular language) and L2=b^n (which is also a regular language) L1.L2 is also regular.. how?? as (a^nb^n) is not a regular language
Updesh Singh
asked
in
Theory of Computation
Dec 26, 2020
by
Updesh Singh
9
points
75
views
self-doubt
toc-languages
0
votes
1
answer
62
views
Theory of automata
Convert the Following DFA to Regular Expression using GNFA.
M.hamza
asked
in
Theory of Computation
Dec 26, 2020
by
M.hamza
5
points
62
views
finite-automata
toc-languages
0
votes
0
answers
19
views
Introduction to Languages and The Theory of Computation
aryan1234
asked
in
Theory of Computation
Dec 23, 2020
by
aryan1234
5
points
19
views
toc-languages
0
votes
0
answers
36
views
Introduction to Languages and The Theory of Computation John C. Martin North Dakota State University
aryan1234
asked
in
Theory of Computation
Dec 23, 2020
by
aryan1234
5
points
36
views
toc-languages
0
votes
0
answers
16
views
Introduction to Languages and The Theory of Computation John C. Martin
aryan1234
asked
in
Theory of Computation
Dec 23, 2020
by
aryan1234
5
points
16
views
toc-languages
Page:
1
2
next »
Ask a Question
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts