Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged peter-linz
0
votes
1
answer
571
TOC peter linz (6 edition)
Find DFA for the following language $L=\left \{ ba^n : n>=1,n\neq 4 \right \}$
Find DFA for the following language$L=\left \{ ba^n : n>=1,n\neq 4 \right \}$
MayankSharma
1.8k
views
MayankSharma
asked
Sep 23, 2017
Theory of Computation
theory-of-computation
peter-linz
+
–
0
votes
1
answer
572
For each regular expression, give two strings that are in the corresponding language and two strings that are not.
For each regular expression, give two strings that are in the corresponding language and two strings that are not.1. (a + b)∗ab(a + b)∗2. b∗ab∗ab∗3. a + (a∗b)...
Garrett McClure
708
views
Garrett McClure
asked
Sep 14, 2017
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
1
votes
0
answers
573
Intro to Formal Languages and Automata Peter Linz Ex. #2.1.2e
For Σ= {a,b}, construct a dfa that accepts the sets consisting of all the strings with exactly two a’s and more than two b’s.
For Σ= {a,b}, construct a dfa that accepts the sets consisting of all the strings with exactly two a’s and more than two b’s.
Garrett McClure
2.9k
views
Garrett McClure
asked
Sep 7, 2017
Theory of Computation
theory-of-computation
peter-linz
grammar
finite-automata
regular-language
+
–
4
votes
5
answers
574
Peter Linz Edition 4 Exercise 2.1 Question 24 (Page No. 49)
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to languages by $truncate (L)= $ {$truncate(w):w ∈ L$} Show how, ... From this, prove that if $L$ is a regular language not containing $λ$, then $truncate (L)$ is also regular.
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to lan...
Ashwani Kumar 2
3.6k
views
Ashwani Kumar 2
asked
Sep 7, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
1
votes
1
answer
575
Peter Linz Edition 4 Exercise 1.2 Question 17 (Page No. 29)
Give a verbal description of the language generated by the productions: S → aSb S → bSa S → aa
Give a verbal description of the language generated by the productions:S → aSbS → bSaS → aa
Garrett McClure
755
views
Garrett McClure
asked
Aug 31, 2017
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
0
votes
2
answers
576
Peter Linz Edition 4 Exercise 1.2 Question 16 (Page No. 29)
Find a grammar that generates the language: L = {$w$w^R$ : $w$ ∈ {a, b}+}
Find a grammar that generates the language:L = {$w$$w^R$ : $w$ ∈ {a, b}+}
Garrett McClure
556
views
Garrett McClure
asked
Aug 31, 2017
Theory of Computation
theory-of-computation
grammar
peter-linz
peter-linz-edition4
context-free-language
+
–
1
votes
1
answer
577
Toc Peter Linz
can anyone provide solution of Toc Peter Linz 6th edition ?
can anyone provide solution of Toc Peter Linz 6th edition ?
Nitesh Choudhary
1.5k
views
Nitesh Choudhary
asked
Jul 9, 2017
Theory of Computation
theory-of-computation
peter-linz
+
–
2
votes
1
answer
578
Peter Linz Edition 4 Exercise 7.1 Question 3.c,3.d,4.f,4.j (Page No. 183)
Q3) Given, $L_1 = (aaa^*b)$ $L_2 = (aab^*aba^*)$ Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$. Q4) Find the npda's of the following: f) $L = \{ a^nb^m :n \leq m \leq 3n\}$ j) $L = \{w : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.
Q3) Given,$L_1 = (aaa^*b)$$L_2 = (aab^*aba^*)$Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$.Q4) Find the npda's of the following:f) $L = \{ a^nb^m...
Shubhanshu
1.9k
views
Shubhanshu
asked
Jul 8, 2017
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
pushdown-automata
npda
+
–
1
votes
3
answers
579
Peter Linz Edition 4 Exercise 3.1 Question 7 (Page No. 76) Exercise 3.3 Question 9 (Page No. 97)
Regular Expression:- Q1) What languages do the expression (∅*)* and a∅ denote? Q2) Find a regular expression and finite automata for all bit strings, with leading bit 1 interpreted as a binary integer, with values not between 10 and 30. ... w ∈ {a, b}* / (number of a in w + 3*number of b) in w is even }
Regular Expression:-Q1) What languages do the expression (∅*)* and a∅ denote?Q2) Find a regular expression and finite automata for all bit strings, with leading b...
Shubhanshu
2.0k
views
Shubhanshu
asked
Jul 5, 2017
Theory of Computation
theory-of-computation
regular-language
regular-expression
regular-grammar
peter-linz
peter-linz-edition4
+
–
4
votes
1
answer
580
Peter Linz Edition 4 Exercise 7.1 Question 4.h(Page No. 183)
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
Vishal Goel
1.8k
views
Vishal Goel
asked
Apr 30, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
votes
2
answers
581
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the language L={an bm | n≥1, m≥1, nm≥3}
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
Ayush Upadhyaya
2.5k
views
Ayush Upadhyaya
asked
Mar 9, 2017
Theory of Computation
theory-of-computation
regular-expression
peter-linz
peter-linz-edition4
+
–
7
votes
2
answers
582
Peter Linz Edition 4 Exercise 2.1 Question 2.d, 2.e (Page No. 47)
(d) all strings with at least one a and exactly two b’s (e) all the strings with exactly two a’s and more than two b’s.
(d) all strings with at least one a and exactly two b’s(e) all the strings with exactly two a’s and more than two b’s.
Pravin Paikrao
18.6k
views
Pravin Paikrao
asked
Nov 2, 2016
Theory of Computation
theory-of-computation
finite-automata
peter-linz
peter-linz-edition4
+
–
2
votes
1
answer
583
Peter Linz Edition 4 Exercise 2.1 Question 7 (Page No. 47)
Plez Tell someone briefly ..............though i have already the anwers but i couldn't get it properlyyy
Plez Tell someone briefly ..............though i have already the anwers but i couldn't get it properlyyy
Vijendra Singh
473
views
Vijendra Singh
asked
Sep 28, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
1
votes
0
answers
584
Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
Find regular expression for $\left \{ a^{n}b^{m}:(n+m)\ is\ even \right \}$.
Find regular expression for$\left \{ a^{n}b^{m}:(n+m)\ is\ even \right \}$.
Jitendra Verma
329
views
Jitendra Verma
asked
Sep 14, 2016
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
+
–
3
votes
2
answers
585
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
im.raj
20.6k
views
im.raj
asked
Jun 16, 2016
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
2
votes
3
answers
586
Peter Linz Edition 4 Exercise 3.1 Question 16.d (Page No. 76)
Find a regular expression over Σ ={a,b,c} for all strings that contain no run of a's of length greater than 2. Here a run in a string is a sub string of length at least two as long as possible and consisting entirely of ... . For eg, the string abbbaab contains a run of b's of length three and a tun of a's of length two.
Find a regular expression over Σ ={a,b,c} for all strings that contain no run of a's of length greater than 2. Here a run in a string is a sub string of length at least ...
Shubhi Tiwari
2.5k
views
Shubhi Tiwari
asked
May 11, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
Page:
« prev
1
...
15
16
17
18
19
20
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register