Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged peter-linz-edition4
2
votes
1
answer
361
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
asked
in
Theory of Computation
Mar 14, 2018
by
Mk Utkarsh
269
views
theory-of-computation
regular-language
peter-linz
peter-linz-edition4
regular-expression
1
vote
3
answers
362
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}\left ( w \right ) \right \}$ ...
Mk Utkarsh
asked
in
Theory of Computation
Feb 27, 2018
by
Mk Utkarsh
717
views
theory-of-computation
peter-linz
peter-linz-edition4
grammar
1
vote
1
answer
363
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
asked
in
Theory of Computation
Feb 26, 2018
by
Mk Utkarsh
274
views
theory-of-computation
grammar
peter-linz
peter-linz-edition4
3
votes
1
answer
364
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
asked
in
Theory of Computation
Feb 26, 2018
by
Mk Utkarsh
367
views
theory-of-computation
peter-linz
peter-linz-edition4
grammar
1
vote
1
answer
365
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 labeled $λ$ can only have it as the rightmost child. $\text{1 & 3}$ $\text{1 & 2}$ $\text{2 & 3}$ $\text{Only 2}$
tarun_svbk
asked
in
Theory of Computation
Feb 24, 2018
by
tarun_svbk
422
views
theory-of-computation
peter-linz
peter-linz-edition4
context-free-grammar
derivation-tree
0
votes
0
answers
366
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 for $L$. There exists a simple grammar for $L$. There exists an unambiguous grammar for $L$. There exists an ambiguous grammar for $L$.
tarun_svbk
asked
in
Theory of Computation
Feb 24, 2018
by
tarun_svbk
227
views
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
grammar
inherently-ambiguous
2
votes
1
answer
367
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
asked
in
Theory of Computation
Feb 19, 2018
by
Manish Kumar 24
790
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
0
votes
0
answers
368
Peter Linz Edition 4 Example 10.5 (Page No. 272)
Find a linear bounded automata that accepts the language 1. L={a^(n!) : n>=0} 2. L ={a^n : n is perfect square} Please explain.
Nikita888
asked
in
Theory of Computation
Nov 16, 2017
by
Nikita888
1.2k
views
theory-of-computation
context-sensitive
peter-linz
peter-linz-edition4
4
votes
5
answers
369
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.
Ashwani Kumar 2
asked
in
Theory of Computation
Sep 7, 2017
by
Ashwani Kumar 2
2.8k
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
1
vote
1
answer
370
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
Garrett McClure
asked
in
Theory of Computation
Aug 31, 2017
by
Garrett McClure
497
views
theory-of-computation
peter-linz
peter-linz-edition4
grammar
0
votes
2
answers
371
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
asked
in
Theory of Computation
Aug 31, 2017
by
Garrett McClure
375
views
theory-of-computation
grammar
peter-linz
peter-linz-edition4
context-free-language
2
votes
1
answer
372
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) \}$.
Shubhanshu
asked
in
Theory of Computation
Jul 8, 2017
by
Shubhanshu
1.5k
views
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
pushdown-automata
npda
1
vote
3
answers
373
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 }
Shubhanshu
asked
in
Theory of Computation
Jul 5, 2017
by
Shubhanshu
1.4k
views
theory-of-computation
regular-language
regular-expression
regular-grammar
peter-linz
peter-linz-edition4
4
votes
1
answer
374
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
asked
in
Theory of Computation
Apr 30, 2017
by
Vishal Goel
1.5k
views
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
0
votes
2
answers
375
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the language L={an bm | n≥1, m≥1, nm≥3}
Ayush Upadhyaya
asked
in
Theory of Computation
Mar 9, 2017
by
Ayush Upadhyaya
862
views
theory-of-computation
regular-expression
peter-linz
peter-linz-edition4
4
votes
2
answers
376
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
asked
in
Theory of Computation
Nov 2, 2016
by
Pravin Paikrao
12.7k
views
theory-of-computation
finite-automata
peter-linz
peter-linz-edition4
2
votes
1
answer
377
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
asked
in
Theory of Computation
Sep 28, 2016
by
Vijendra Singh
326
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
1
vote
0
answers
378
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
asked
in
Theory of Computation
Sep 14, 2016
by
Jitendra Verma
259
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
2
votes
2
answers
379
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 the same symbol. For eg, the string abbbaab contains a run of b's of length three and a tun of a's of length two.
Shubhi Tiwari
asked
in
Theory of Computation
May 11, 2016
by
Shubhi Tiwari
1.8k
views
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
Page:
« prev
1
...
8
9
10
11
12
13
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged peter-linz-edition4
Recent Blog Comments
Man, I feel you! I left my job to do gate this...
Yes, CDU provides assistance for internships...
Are you fully aware of the job opportunities in...
When this exam will happen ?
Can Someone guide me how to prepare for interview...