Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged peter-linz-edition4
3
3 votes
1
1 answer
5.3k
5.3k views
Peter Linz Edition 4 Exercise 3.1 Question 10 (Page No. 76)
Give a regular expression forL = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
Mk Utkarsh
5.3k
views
asked
Mar 14, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
2
2 votes
1
answers
1 answer
710
710 views
Peter Linz Edition 4 Exercise 3.1 Question 9 (Page No. 76)
Give a regular expression for $L^{R}$L = $(a+bc)^{*}(c+\phi)$
Mk Utkarsh
710
views
asked
Mar 14, 2018
Theory of Computation
theory-of-computation
regular-language
peter-linz
peter-linz-edition4
regular-expression
+
–
1
1 vote
3
answers
3 answers
2.7k
2.7k views
Peter Linz Edition 4 Exercise 1.2 Question 18 (Page No. 29)
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$$L = \left \{ w : n_{a}\left ( w \right ) n_{b}\...
Mk Utkarsh
2.7k
views
asked
Feb 26, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
1
1 vote
1
1 answer
575
575 views
Peter Linz Edition 4 Exercise 1.2 Question 15.d (Page No. 29)
Find the grammar for the following language$L = \left \{ w: \left | w \right | mod 3 \geq \left | w \right | mod 2 \right \}$
Mk Utkarsh
575
views
asked
Feb 26, 2018
Theory of Computation
theory-of-computation
grammar
peter-linz
peter-linz-edition4
+
–
3
3 votes
1
answers
1 answer
848
848 views
Peter Linz Edition 4 Exercise 1.2 Question 14.g (Page No. 29)
$L = \left \{ a^{n} b^{m} : n\geq 0,m>n \right \}$Find a grammar that generates $L^3$
Mk Utkarsh
848
views
asked
Feb 26, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
1
1 vote
1
1 answer
1.5k
1.5k views
Peter Linz Edition 4 Derivation Trees Definition 5.3 (Page No. 130)
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ?The root is labeled $S$.Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$.A vertex with a child...
tarun_svbk
1.5k
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
context-free-grammar
derivation-tree
+
–
0
0 votes
0
0 answers
687
687 views
Peter Linz Edition 4 Example 5.13 (Page No. 144)
Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct?There is no context free grammar possible...
tarun_svbk
687
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
grammar
inherently-ambiguous
+
–
2
2 votes
1
1 answer
2.2k
2.2k views
Peter Linz Edition 4 Exercise 2.1 Question 7.e (Page No. 47)
Please help in creating the DFA for (na (w)-nb (w))mod 3>0
Manish Kumar 24
2.2k
views
asked
Feb 19, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
0
0 votes
0
0 answers
2.3k
2.3k views
Peter Linz Edition 4 Example 10.5 (Page No. 272)
Find a linear bounded automata that accepts the language1. L={a^(n!) : n>=0}2. L ={a^n : n is perfect square}Please explain.
Nikita888
2.3k
views
asked
Nov 16, 2017
Theory of Computation
theory-of-computation
context-sensitive
peter-linz
peter-linz-edition4
+
–
4
4 votes
5
5 answers
5.3k
5.3k views
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 lan...
Ashwani Kumar 2
5.3k
views
asked
Sep 7, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
1
1 vote
1
answers
1 answer
1.3k
1.3k views
Peter Linz Edition 4 Exercise 1.2 Question 17 (Page No. 29)
Give a verbal description of the language generated by the productions:S → aSbS → bSaS → aa
Garrett McClure
1.3k
views
asked
Aug 31, 2017
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
0
0 votes
2
answers
2 answers
949
949 views
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}+}
Garrett McClure
949
views
asked
Aug 31, 2017
Theory of Computation
theory-of-computation
grammar
peter-linz
peter-linz-edition4
context-free-language
+
–
2
2 votes
1
1 answer
2.3k
2.3k views
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...
Shubhanshu
2.3k
views
asked
Jul 8, 2017
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
pushdown-automata
npda
+
–
1
1 vote
3
3 answers
2.8k
2.8k views
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...
Shubhanshu
2.8k
views
asked
Jul 5, 2017
Theory of Computation
theory-of-computation
regular-language
regular-expression
regular-grammar
peter-linz
peter-linz-edition4
+
–
4
4 votes
1
1 answer
2.4k
2.4k views
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)$ }
Vishal Goel
2.4k
views
asked
Apr 30, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
0 votes
2
2 answers
3.7k
3.7k views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
Ayush Upadhyaya
3.7k
views
asked
Mar 9, 2017
Theory of Computation
theory-of-computation
regular-expression
peter-linz
peter-linz-edition4
+
–
8
8 votes
2
answers
2 answers
22.9k
22.9k views
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.
Pravin Paikrao
22.9k
views
asked
Nov 2, 2016
Theory of Computation
theory-of-computation
finite-automata
peter-linz
peter-linz-edition4
+
–
2
2 votes
1
answers
1 answer
805
805 views
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
Vijendra Singh
805
views
asked
Sep 28, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
1
1 vote
0
0 answers
624
624 views
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 \}$.
Jitendra Verma
624
views
asked
Sep 14, 2016
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
+
–
2
2 votes
3
answers
3 answers
3.4k
3.4k views
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 t...
Shubhi Tiwari
3.4k
views
asked
May 11, 2016
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
Page:
« prev
1
...
8
9
10
11
12
13