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
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 \}$
MayankSharma
asked
in
Theory of Computation
Sep 23, 2017
by
MayankSharma
1.8k
views
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.
Garrett McClure
asked
in
Theory of Computation
Sep 14, 2017
by
Garrett McClure
717
views
theory-of-computation
regular-expression
peter-linz
1
vote
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.
Garrett McClure
asked
in
Theory of Computation
Sep 7, 2017
by
Garrett McClure
2.9k
views
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.
Ashwani Kumar 2
asked
in
Theory of Computation
Sep 7, 2017
by
Ashwani Kumar 2
3.6k
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
1
vote
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
Garrett McClure
asked
in
Theory of Computation
Aug 31, 2017
by
Garrett McClure
762
views
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}+}
Garrett McClure
asked
in
Theory of Computation
Aug 31, 2017
by
Garrett McClure
567
views
theory-of-computation
grammar
peter-linz
peter-linz-edition4
context-free-language
1
vote
1
answer
577
Toc Peter Linz
can anyone provide solution of Toc Peter Linz 6th edition ?
Nitesh Choudhary
asked
in
Theory of Computation
Jul 9, 2017
by
Nitesh Choudhary
1.6k
views
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) \}$.
Shubhanshu
asked
in
Theory of Computation
Jul 8, 2017
by
Shubhanshu
1.9k
views
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
pushdown-automata
npda
1
vote
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 }
Shubhanshu
asked
in
Theory of Computation
Jul 5, 2017
by
Shubhanshu
2.0k
views
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)$ }
Vishal Goel
asked
in
Theory of Computation
Apr 30, 2017
by
Vishal Goel
1.8k
views
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}
Ayush Upadhyaya
asked
in
Theory of Computation
Mar 9, 2017
by
Ayush Upadhyaya
2.5k
views
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.
Pravin Paikrao
asked
in
Theory of Computation
Nov 2, 2016
by
Pravin Paikrao
18.6k
views
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
Vijendra Singh
asked
in
Theory of Computation
Sep 28, 2016
by
Vijendra Singh
485
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
1
vote
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 \}$.
Jitendra Verma
asked
in
Theory of Computation
Sep 14, 2016
by
Jitendra Verma
337
views
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
im.raj
asked
in
Theory of Computation
Jun 16, 2016
by
im.raj
20.5k
views
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.
Shubhi Tiwari
asked
in
Theory of Computation
May 11, 2016
by
Shubhi Tiwari
2.5k
views
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
Page:
« prev
1
...
15
16
17
18
19
20
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged peter-linz
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...