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

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged toclanguages
0
votes
1
answer
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 (mn) a's or (nm) b's will remain in the stack meaning (m!=n). How can we check for (n=k) now?
asked
Feb 6
in
Theory of Computation
by
shantanu4raje
(
25
points)

39
views
toclanguages
selfdoubt
0
votes
0
answers
made easy test series
Answer given is “All of these” My answer is none of these are regular.
asked
Feb 3
in
Theory of Computation
by
rahul65
(
5
points)

19
views
toclanguages
0
votes
0
answers
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
asked
Feb 2
in
Theory of Computation
by
kirtipurohit
(
7
points)

19
views
testseries
toclanguages
0
votes
0
answers
Gate Overflow itself
Is the explanation is correct? Linkhttps://gateoverflow.in/33183/complementofcsl 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?
asked
Feb 1
in
Theory of Computation
by
RavGopal
(
145
points)

25
views
toclanguages
0
votes
0
answers
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
asked
Feb 1
in
Theory of Computation
by
Abhineet Singh
(
23
points)

21
views
decidability
toclanguages
+1
vote
0
answers
Recursive Languages Self Doubt
Is recursive language closed under positive closure?
asked
Jan 29
in
Theory of Computation
by
aditi19
(
53
points)

24
views
toclanguages
0
votes
0
answers
Madeeasy Test series TOC Q1
asked
Jan 23
in
Theory of Computation
by
Shivateja MST
(
45
points)

10
views
toclanguages
0
votes
0
answers
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
asked
Jan 18
in
Theory of Computation
by
kirtipurohit
(
7
points)

9
views
toclanguages
peterlinz
grammar
dfas
pumpinglemma
0
votes
1
answer
Show that the language S> aSS b is not regular ?
asked
Jan 18
in
Theory of Computation
by
kirtipurohit
(
7
points)

20
views
toclanguages
peterlinz
0
votes
0
answers
An introduction to formal languages and automata peter linz
asked
Jan 16
in
Theory of Computation
by
kirtipurohit
(
7
points)

27
views
toclanguages
peterlinz
grammar
dfas
nfadfa
0
votes
0
answers
Peter Linz 5e Ex2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)n_{b}(w))mod3>0$ }
asked
Jan 14
in
Theory of Computation
by
aditi19
(
53
points)

10
views
peterlinz
toclanguages
dfas
+1
vote
0
answers
Peter Linz 5e Ex2.1 Q7e DFA
Find DFA on $\Sigma =(a,b)$ for L={ w : $(n_{a}(w)n_{b}(w))mod3>0$ }
asked
Jan 14
in
Theory of Computation
by
aditi19
(
53
points)

30
views
peterlinz
toclanguages
dfas
0
votes
1
answer
Applied Test Series TOC
Options: My answer was: D answer according to them was B and D and their explaination was
asked
Jan 4
in
Theory of Computation
by
Nitinkumar.097
(
13
points)

28
views
testseries
toclanguages
0
votes
0
answers
GATE 2003 , Theory Of Computation , Turing Machine
asked
Jan 4
in
Theory of Computation
by
Pushkar Khadase
(
5
points)

30
views
toclanguages
turingmachine
0
votes
3
answers
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
asked
Dec 30, 2020
in
Theory of Computation
by
tvs6
(
5
points)

44
views
toclanguages
0
votes
2
answers
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
asked
Dec 26, 2020
in
Theory of Computation
by
Updesh Singh
(
5
points)

49
views
selfdoubt
toclanguages
0
votes
1
answer
Theory of automata
Convert the Following DFA to Regular Expression using GNFA.
asked
Dec 26, 2020
in
Theory of Computation
by
M.hamza
(
5
points)

42
views
finiteautomata
toclanguages
0
votes
0
answers
Introduction to Languages and The Theory of Computation
asked
Dec 23, 2020
in
Theory of Computation
by
aryan1234
(
5
points)

6
views
toclanguages
0
votes
0
answers
Introduction to Languages and The Theory of Computation John C. Martin North Dakota State University
asked
Dec 23, 2020
in
Theory of Computation
by
aryan1234
(
5
points)

9
views
toclanguages
0
votes
0
answers
Introduction to Languages and The Theory of Computation John C. Martin
asked
Dec 23, 2020
in
Theory of Computation
by
aryan1234
(
5
points)

8
views
toclanguages
0
votes
1
answer
#selfdoubt #regular_toc_languages
asked
Dec 21, 2020
in
Theory of Computation
by
gajendercse
(
41
points)

26
views
selfdoubt
toclanguages
0
votes
1
answer
theory of computation
Can some one identify what is the language&PDA for this CFG & is it DCFL / NCFL ? E>E+E E>E*E E>id
asked
Dec 14, 2020
in
Theory of Computation
by
vrajdobariya
(
9
points)

24
views
toclanguages
selfdoubt
+1
vote
1
answer
NLCIL2020(basic)
Q.1) which of the following represent $ab^{*}+b^{*}$ a)starting with “a” and followed by “b”. b)having “a”s but not “b”s. c)having no “a”s but only “b”s. d)b starting with an a having no other “a”s or “a”s but only “b”s.
asked
Nov 30, 2020
in
Theory of Computation
by
BASANT KUMAR
(
25
points)

30
views
toclanguages
0
votes
0
answers
Self Doubt: TOC Languages
Say I am given an arbitrary language – a set of words. Is there any standard way to determine if the set of words is Regular or ContextFree or Recursive or Recursively Enumerable
asked
Nov 25, 2020
in
Theory of Computation
by
swaroopnath
(
5
points)

24
views
selfdoubt
toclanguages
gatesyllabus
0
votes
1
answer
Introduction to automata Peter Linz 6th edition Exercise 1.2
asked
Nov 25, 2020
in
Theory of Computation
by
Sohil Bhanani
(
5
points)

49
views
peterlinz
peterlinz
toclanguages
0
votes
0
answers
applied gate
Q.25)Max Marks: 2Subject: Theory of Computation A B C Correct Option Solution: (C) D None of these Your answer is Wrong
asked
Nov 23, 2020
in
Theory of Computation
by
Mayur Rasadiya
(
5
points)

20
views
toclanguages
0
votes
0
answers
applied gate
Q.1)Max Marks: 1Subject: Theory of Computation Suppose that L is context free and R is regular. Consider the following statements I. Is L  R necessarily context free II. Is R  L necessarily context free A I is True Correct Option Solution: (A)
asked
Nov 22, 2020
in
Theory of Computation
by
Mayur Rasadiya
(
5
points)

17
views
toclanguages
0
votes
0
answers
applied gate
Q.2)Max Marks: 1Subject: Theory of Computation A Regular but not context free B Not Regular but Context free Correct Option  Attempted Solution: (B) C Neither Regular nor Context free D Regular and Context free
asked
Nov 22, 2020
in
Theory of Computation
by
Mayur Rasadiya
(
5
points)

12
views
toclanguages
0
votes
1
answer
Just thinking about it
Since Reduce entries in both LR(0) and SLR(1) are different. so does that mean error entries will also be different in these two.
asked
Nov 22, 2020
in
Compiler Design
by
amanizardar
(
5
points)

22
views
selfdoubt
toclanguages
+1
vote
1
answer
ACE Academy Booklet
asked
Nov 12, 2020
in
Theory of Computation
by
Vishal_kumar98
(
37
points)

37
views
toclanguages
+1
vote
1
answer
ACE Academy Booklet
asked
Nov 9, 2020
in
Theory of Computation
by
Vishal_kumar98
(
37
points)

22
views
toclanguages
0
votes
2
answers
miscellaneous
in this question GATE20089 Which of the following is true for the language {a^p∣p is a prime }? It is not accepted by a Turing Machine It is regular but not contextfree It is contextfree but not regular It is neither regular nor contextfree, but accepted by a Turing machine why is it not regular … as in we can for NFA for it?
asked
Nov 2, 2020
in
Theory of Computation
by
rish1602
(
9
points)

39
views
toclanguages
0
votes
2
answers
theory of computation
hi guys, I have a doubt if two DFA accept the same set of language then are they equal? why or why not? answer really appreciated
asked
Oct 24, 2020
in
Theory of Computation
by
rish1602
(
9
points)

52
views
toclanguages
finiteautomata
0
votes
0
answers
Self Doubt in Theory of Computation, Regular Language
asked
Oct 19, 2020
in
Theory of Computation
by
nvs16
(
9
points)

55
views
selfdoubt
toclanguages
0
votes
0
answers
#TOC SELF DOUBT ISI 2014
L IS SUBSET OF {A,B}* AND If L* is regular, then is L regular? JUSTIFY YOUR ANSWER.
asked
Oct 2, 2020
in
Theory of Computation
by
iarnav
(
231
points)

11
views
selfdoubt
toclanguages
0
votes
0
answers
TOC self doubt
L={ a^m b^n  m,n>=0} We know above language is regular as it doesn’t need any comparisons…. But Here L={ϵ, a,b,abb,aab,aabbb………...} If we take aabbb and if we apply Pumping Lemma by taken u=a, v=ab and w=bb let i=1 then we get aababbb which will not be in given language then how come it is regular? Where am i going wrong?
asked
Sep 30, 2020
in
Theory of Computation
by
Pathki Shivamsh
(
9
points)

19
views
toclanguages
0
votes
0
answers
#TOC Whether give languages are DCFL or just CFL?
Please explain for all these 4 languages about which of them are DCFL and which are just CFL only? Thank you.
asked
Sep 29, 2020
in
Theory of Computation
by
iarnav
(
231
points)

10
views
toclanguages
0
votes
0
answers
TOC Self Doubt
L1= a^n b^n n>=0 L2=ww^r  w ϵ (a+b)* what will be the prefix(L1),Suffix(L1) and prefix(L2),Suffix(L2) ??? Please Explain in detail
asked
Sep 26, 2020
in
Theory of Computation
by
Pathki Shivamsh
(
9
points)

26
views
toclanguages
0
votes
1
answer
#Toc Madeeasy
L = { $a^nb^m\;\; m>n \;or\; m<n$ } – is this language dcfl ?
asked
Sep 16, 2020
in
Theory of Computation
by
Sangreela Singh
(
11
points)

57
views
dcfl
toclanguages
+2
votes
1
answer
Made Easy Test Series
Let L1 be decidable language and L2 be turing recognizable but not decidable language, then – L2/L1 is turing recognizable L1/L2 is decidable language Number of correct statements _?
asked
Jul 15, 2020
in
Theory of Computation
by
Kindaichi
(
10
points)

146
views
madeeasytestseries
toclanguages
theoryofcomputation
turingmachine
Page:
1
2
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
9,105
questions
3,156
answers
14,594
comments
95,955
users