menu
Recent questions tagged peter-linz
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged peter-linz
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged peter-linz
0
votes
0
answers
59
views
Introduction to logic circuits and logic design using VHDL, chapter combinational logic design, pg-111.
Noob coder
asked
in
Digital Logic
Sep 2, 2021
by
Noob coder
5
points
59
views
digital-logic
combinational-circuits
self-doubt
dfas
peter-linz
0
votes
0
answers
23
views
An introduction to formal languges
Construct Turing machines that will accept the following languages on {a, b}. L= {w|w| is even}.
Rahul_18
asked
in
Theory of Computation
Jul 1, 2021
by
Rahul_18
5
points
23
views
peter-linz
turing-machine
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
110
views
Peter Linz An Introduction to Formal Languages and Automata 6th edition chapter 1.3 exercise 12
cherryred1
asked
in
Theory of Computation
Mar 17, 2021
by
cherryred1
5
points
110
views
peter-linz
1
vote
1
answer
53
views
Peter Linz Ex-7.3 Q6 CFL
L=$a^nb^{2n} | n\geq 0$ is a DCFL. Show that L* is DCFL
aditi19
asked
in
Theory of Computation
Jan 22, 2021
by
aditi19
59
points
53
views
peter-linz
dcfl
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
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
35
views
Peter Linz, EX-3.1, Q10
Give a regular expression for L = {anbm: n ≥ 1,m ≥ 1,nm ≥ 3}
rahul65
asked
in
Theory of Computation
Dec 18, 2020
by
rahul65
5
points
35
views
peter-linz
0
votes
1
answer
96
views
Introduction to automata Peter Linz 6th edition Exercise 1.2
Sohil Bhanani
asked
in
Theory of Computation
Nov 25, 2020
by
Sohil Bhanani
5
points
96
views
peter-linz
peterlinz
toc-languages
0
votes
0
answers
43
views
Peter Linz 5th edition
Find grammars for the following languages on ∑ = {a}, L = {w : |w| mod 3 > 0}.
PrinceSoni
asked
in
Theory of Computation
Oct 19, 2020
by
PrinceSoni
5
points
43
views
peter-linz
0
votes
0
answers
31
views
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
ijnuhb
asked
in
Theory of Computation
Sep 18, 2020
by
ijnuhb
751
points
31
views
peter-linz
0
votes
0
answers
37
views
Peter Linz Exercise-8.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}
aditi19
asked
in
Theory of Computation
Jun 16, 2020
by
aditi19
59
points
37
views
theory-of-computation
peter-linz
context-free-languages
0
votes
0
answers
47
views
Peter Linz Theory of Computation Exercise 5.1 Question-15
aditi19
asked
in
Theory of Computation
Jun 11, 2020
by
aditi19
59
points
47
views
theory-of-computation
peter-linz
context-free-languages
0
votes
0
answers
26
views
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∗).
lokopi
asked
in
Theory of Computation
Apr 8, 2020
by
lokopi
5
points
26
views
theory-of-computation
peter-linz
0
votes
0
answers
42
views
what is the Meaning of following in peter linz algortihm for Chapter 3 , Nfa to Rex?
lokopi
asked
in
Theory of Computation
Apr 1, 2020
by
lokopi
5
points
42
views
theory-of-computation
peter-linz
0
votes
0
answers
41
views
Self Doubt 5:Peter Linz(exercise 1.2)
$L1={a^{n} b^{m};n>=0,m<n}$ $L2={a^{n} b^{(n-2)};n>=3}$ $L3=complement$ $of$ $L2.$ $L1-L3$ is? According to me $L1-L3$ is same as $L2$. Please verify.
Doraemon
asked
in
Theory of Computation
Apr 1, 2020
by
Doraemon
73
points
41
views
theory-of-computation
peter-linz
0
votes
1
answer
29
views
self doubt 4 -Peter Linz-chapter 7.
It has been told in Peter Linz that if L1 is deterministic context-free and L2 is regular, then a) the language L1 ∪ L2 is deterministic context-free b) the language L1 ∩ L2 is deterministic context-free. 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?
Doraemon
asked
in
Theory of Computation
Mar 31, 2020
by
Doraemon
73
points
29
views
theory-of-computation
peter-linz
0
votes
1
answer
27
views
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)
Doraemon
asked
in
Theory of Computation
Mar 30, 2020
by
Doraemon
73
points
27
views
theory-of-computation
peter-linz
0
votes
1
answer
42
views
TYPE OF THE LANGUAGE-Peter 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?
Doraemon
asked
in
Theory of Computation
Mar 27, 2020
by
Doraemon
73
points
42
views
theory-of-computation
peter-linz
0
votes
0
answers
26
views
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.
Ritesh yadav
asked
in
Theory of Computation
Feb 17, 2020
by
Ritesh yadav
5
points
26
views
theory-of-computation
peter-linz
1
vote
0
answers
82
views
Peter Linz-TOC
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)$
KUSHAGRA गुप्ता
asked
in
Theory of Computation
Oct 6, 2019
by
KUSHAGRA गुप्ता
1.4k
points
82
views
theory-of-computation
peter-linz
0
votes
0
answers
62
views
peter-linz-edition-4-exercise-4.3-question-3,4,5-page-no-122(Modified)
KUSHAGRA गुप्ता
asked
in
Theory of Computation
Oct 3, 2019
by
KUSHAGRA गुप्ता
1.4k
points
62
views
theory-of-computation
peter-linz
0
votes
0
answers
238
views
Peter Linz Edition 4 Exercise 2.1 Question 7-c,d,e,f (Page No. 47)
KUSHAGRA गुप्ता
asked
in
Theory of Computation
Sep 27, 2019
by
KUSHAGRA गुप्ता
1.4k
points
238
views
peter-linz
regular-languages
theory-of-computation
0
votes
1
answer
73
views
Peter Linz-Chapter: 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?
KUSHAGRA गुप्ता
asked
in
Theory of Computation
Sep 7, 2019
by
KUSHAGRA गुप्ता
1.4k
points
73
views
decidability
theory-of-computation
peter-linz
0
votes
1
answer
53
views
PETER LINZ-DFA
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:)
Doraemon
asked
in
Theory of Computation
Aug 18, 2019
by
Doraemon
73
points
53
views
theory-of-computation
peter-linz
1
vote
0
answers
398
views
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.
GATE_aspirant_2021
asked
in
Theory of Computation
Aug 17, 2019
by
GATE_aspirant_2021
13
points
398
views
theory-of-computation
peter-linz
self-doubt
0
votes
1
answer
112
views
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.$
googlegoku
asked
in
Theory of Computation
Jul 6, 2019
by
googlegoku
5
points
112
views
grammar
theory-of-computation
peter-linz
0
votes
0
answers
32
views
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$
aditi19
asked
in
Theory of Computation
Jun 20, 2019
by
aditi19
59
points
32
views
grammar
theory-of-computation
peter-linz
To see more, click for the
full list of questions
or
popular tags
.
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