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
Previous Year
Exams
Recent questions tagged peterlinz
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
in
Theory of Computation
by
lokopi
(
7
points)

12
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
in
Theory of Computation
by
lokopi
(
7
points)

15
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
in
Theory of Computation
by
Doraemon
(
114
points)

19
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
in
Theory of Computation
by
Doraemon
(
114
points)

14
views
theoryofcomputation
peterlinz
0
votes
0
answers
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
in
Theory of Computation
by
Doraemon
(
114
points)

5
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
in
Theory of Computation
by
Doraemon
(
114
points)

21
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
in
Theory of Computation
by
Ritesh yadav
(
7
points)

11
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 गुप्ता
(
400
points)

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

19
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 गुप्ता
(
400
points)

34
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 गुप्ता
(
400
points)

29
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
(
114
points)

14
views
theoryofcomputation
peterlinz
0
votes
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
(
7
points)

63
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
(
9
points)

21
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
(
55
points)

17
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.
Top Users
May 2020
Kushagra गुप्ता
97 Points
praveen modala
15 Points
ramcharantej_24
15 Points
abhishek tiwary
12 Points
srestha
12 Points
Dtiwari
9 Points
Shivateja MST
8 Points
ankitgupta.1729
8 Points
Rashimdixit
7 Points
Bhavya1902
7 Points
7,376
questions
1,741
answers
10,682
comments
90,352
users