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 peterlinz
+1
vote
0
answers
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a leftlinear grammar for the language S→ abA A → baB B → aA  bb.
asked
May 3
in
Theory of Computation
by
Setsu
(
13
points)

9
views
peterlinz
toclanguages
peterlinz
+1
vote
0
answers
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a leftlinear grammar for the language S→ abA A → baB B → aA  bb.
asked
May 3
in
Theory of Computation
by
Setsu
(
13
points)

6
views
peterlinz
toclanguages
peterlinz
0
votes
0
answers
Peter Linz An Introduction to Formal Languages and Automata 6th edition chapter 1.3 exercise 12
asked
Mar 17
in
Theory of Computation
by
cherryred1
(
5
points)

23
views
peterlinz
+1
vote
1
answer
Peter Linz Ex7.3 Q6 CFL
L=$a^nb^{2n}  n\geq 0$ is a DCFL. Show that L* is DCFL
asked
Jan 22
in
Theory of Computation
by
aditi19
(
53
points)

40
views
peterlinz
dcfl
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
(
15
points)

10
views
toclanguages
peterlinz
grammar
dfas
pumpinglemma
0
votes
0
answers
An introduction to formal languages and automata peter linz
asked
Jan 16
in
Theory of Computation
by
kirtipurohit
(
15
points)

45
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)

13
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)

32
views
peterlinz
toclanguages
dfas
0
votes
1
answer
Peter Linz, EX3.1, Q10
Give a regular expression for L = {anbm: n ≥ 1,m ≥ 1,nm ≥ 3}
asked
Dec 18, 2020
in
Theory of Computation
by
rahul65
(
5
points)

21
views
peterlinz
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)

58
views
peterlinz
peterlinz
toclanguages
0
votes
0
answers
Peter Linz 5th edition
Find grammars for the following languages on ∑ = {a}, L = {w : w mod 3 > 0}.
asked
Oct 19, 2020
in
Theory of Computation
by
PrinceSoni
(
5
points)

16
views
peterlinz
0
votes
0
answers
PETER LINZ PG 78 Q13
$L$= {a^{n}b^{m}  n\geqslant 2, m\geq 1, nm\geqslant 3}$ What will be the Regular expression for this
asked
Sep 18, 2020
in
Theory of Computation
by
ijnuhb
(
747
points)

19
views
peterlinz
0
votes
0
answers
Peter Linz Exercise8.2 Context Free Lnaguages
Show that the following language is context free L={$w\epsilon (a, b)$* : $n_{a}(w)=n_{b}(w)$, w does not contain the substring aab}
asked
Jun 16, 2020
in
Theory of Computation
by
aditi19
(
53
points)

24
views
theoryofcomputation
peterlinz
contextfreelanguages
0
votes
0
answers
Peter Linz Theory of Computation Exercise 5.1 Question15
asked
Jun 11, 2020
in
Theory of Computation
by
aditi19
(
53
points)

25
views
theoryofcomputation
peterlinz
contextfreelanguages
0
votes
0
answers
Right quotient of a∗baa∗ with ab∗
Hello i am new to this concept. Take two languages: L1=a∗baa∗ L2=ab∗ and L1/L2 (right quotient) would be (a∗b+a∗baa∗)? Does this mean that suffix of L1 and anything from L2 I mean 'a' in L2 which would be suffix of L1 and hence we would remove it.)? I searched internet and found this link but it is not clear to me how L1/L2 is (a∗b+a∗baa∗).
asked
Apr 8, 2020
in
Theory of Computation
by
lokopi
(
5
points)

18
views
theoryofcomputation
peterlinz
0
votes
0
answers
what is the Meaning of following in peter linz algortihm for Chapter 3 , Nfa to Rex?
asked
Apr 1, 2020
in
Theory of Computation
by
lokopi
(
5
points)

27
views
theoryofcomputation
peterlinz
0
votes
0
answers
Self Doubt 5:Peter Linz(exercise 1.2)
$L1={a^{n} b^{m};n>=0,m<n}$ $L2={a^{n} b^{(n2)};n>=3}$ $L3=complement$ $of$ $L2.$ $L1L3$ is? According to me $L1L3$ is same as $L2$. Please verify.
asked
Apr 1, 2020
in
Theory of Computation
by
Doraemon
(
69
points)

30
views
theoryofcomputation
peterlinz
0
votes
1
answer
self doubt 4 Peter Linzchapter 7.
It has been told in Peter Linz that if L1 is deterministic contextfree and L2 is regular, then a) the language L1 ∪ L2 is deterministic contextfree b) the language L1 ∩ L2 is deterministic contextfree. But DCFL is not closed under ... regular language is a DCFL then automatically , therefore L1UL2 and L1 ∩ L2 might not be closed. Can anyone please verify?
asked
Mar 31, 2020
in
Theory of Computation
by
Doraemon
(
69
points)

20
views
theoryofcomputation
peterlinz
0
votes
1
answer
REQUEST FOR SOLTION MANUAL FOR PETER LINZ
Can anyone provide me with the solution manual for 6TH EDITION OF PETERLINZ.(or if not available any edition you have)
asked
Mar 30, 2020
in
Theory of Computation
by
Doraemon
(
69
points)

22
views
theoryofcomputation
peterlinz
0
votes
1
answer
TYPE OF THE LANGUAGEPeter Linz chapter 4
L={a^n:n is either prime or product of 2 or more prime numbers} According to me this is regular. Can anyone verify?
asked
Mar 27, 2020
in
Theory of Computation
by
Doraemon
(
69
points)

34
views
theoryofcomputation
peterlinz
0
votes
0
answers
regular expression self doubt
Given the regular expression L(ab*aa+bba*ab). in this question my doubt is what is the number of states in minimum nfa and minimum dfa for this expression.
asked
Feb 17, 2020
in
Theory of Computation
by
Ritesh yadav
(
5
points)

19
views
theoryofcomputation
peterlinz
+1
vote
0
answers
Peter LinzTOC
What are these languages among them: Regular, DCFL, CFL, CSL, REC, RE ? $L1=(w_{1}w_{2}: w_{1}\neq w_{2}: w_{1}=w_{2} )$ $L2=(a^nb^m: m=n^2,n\geqslant 1 )$ $\\L3=(w^n : w\epsilon (a,b)^+,n\geqslant 2)\\ L4=(www^R: w\epsilon (a,b)^+)$ $L5=(wuw^R: w,u \ \epsilon (a,b)^+, w\geqslant u)$ $L6=(a^nb^ma^{nm}: n\geqslant 1,m\geqslant 1)$
asked
Oct 6, 2019
in
Theory of Computation
by
KUSHAGRA गुप्ता
(
1.4k
points)

68
views
theoryofcomputation
peterlinz
0
votes
0
answers
peterlinzedition4exercise4.3question3,4,5pageno122(Modified)
asked
Oct 3, 2019
in
Theory of Computation
by
KUSHAGRA गुप्ता
(
1.4k
points)

34
views
theoryofcomputation
peterlinz
0
votes
0
answers
Peter Linz Edition 4 Exercise 2.1 Question 7c,d,e,f (Page No. 47)
asked
Sep 27, 2019
in
Theory of Computation
by
KUSHAGRA गुप्ता
(
1.4k
points)

149
views
peterlinz
regularlanguages
theoryofcomputation
0
votes
1
answer
Peter LinzChapter: 12 Exercise: 12.4
Let G1 be a context free grammar and G2 a regular grammar. Is the problem decidable? $L(G1) \cap L(G2)= \phi$ Let L1 be a regular language and G a context free grammar. Is the problem decidable? $L1\subseteq L(G)$ 3. Let G1 and G2 be ... with G1 regular. Is the problem decidable when: $L(G1)=L(G2)$ * G2 is unrestricted * G2 is context free * G2 is regular?
asked
Sep 7, 2019
in
Theory of Computation
by
KUSHAGRA गुप्ता
(
1.4k
points)

50
views
decidability
theoryofcomputation
peterlinz
0
votes
1
answer
PETER LINZDFA
The minimum number of states for these 2 languages: L1={w: (n(a)n(b)) mod 3=2} L2={w: (n(a)n(b)) mod 3=0} I am getting 9 for both of them .Please verify:)
asked
Aug 18, 2019
in
Theory of Computation
by
Doraemon
(
69
points)

34
views
theoryofcomputation
peterlinz
+1
vote
0
answers
Peter Linz Exercise 1.3 Question 12
Design a transducer to convert a binary string into octal. For example, the bit string 001101110 should produce the output 156. In this case, are we given only those binary strings whose lengths are multiples of 3? Are we reading the binary string in reverse or normally? Also, please provide the solution to this problem.
asked
Aug 17, 2019
in
Theory of Computation
by
GATE_aspirant_2021
(
13
points)

284
views
theoryofcomputation
peterlinz
selfdoubt
0
votes
1
answer
Peter Linz
Write the grammar for the following language : $L = \{w : n_a (w)= n_b (w) + 1\}$ where no. of $a’s$ is one more than no. of $b’s.$
asked
Jul 6, 2019
in
Theory of Computation
by
googlegoku
(
5
points)

85
views
grammar
theoryofcomputation
peterlinz
0
votes
0
answers
Peter Linz Doubt Grammars
Find grammar for the language on $\sum$={a} L={w  w mod 3>0} is this correct? S>aA A>aB  $\varepsilon$ B>aS  $\varepsilon$
asked
Jun 20, 2019
in
Theory of Computation
by
aditi19
(
53
points)

25
views
grammar
theoryofcomputation
peterlinz
To see more, click for the
full list of questions
or
popular tags
.
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,270
questions
3,204
answers
14,751
comments
96,304
users