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
Peter Linz Edition 4 Exercise 2.3 Question 12 (Page No. 62)
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
192
views
0
votes
0
votes
Show that if $L$ is regular, so is $L^R$.
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
regular-language
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
192
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
208
views
Peter Linz Edition 4 Exercise 2.3 Question 11 (Page No. 62)
Prove that all finite languages are regular.
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
208
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
regular-language
0
votes
0
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
188
views
Peter Linz Edition 4 Exercise 3.2 Question 18 (Page No. 89)
Find nfa's for $L (aØ)$ and $L (Ø^*)$. Is the result consistent with the definition of these languages?
Naveen Kumar 3
asked
in
Theory of Computation
Apr 3, 2019
by
Naveen Kumar 3
188
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
finite-automata
2
votes
2
votes
2
answers
3
aditi19
asked
in
Theory of Computation
Feb 22, 2019
920
views
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
aditi19
asked
in
Theory of Computation
Feb 22, 2019
by
aditi19
920
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
regular-expression
1
vote
1
vote
0
answers
4
vaibhav singh 3
asked
in
Theory of Computation
Sep 14, 2018
606
views
Peter Linz Edition 4 Exercise 2.3 Question 15 (Page No. 63)
From a language $L$ we create a new language $chop2 (L)$ by removing the two leftmost symbols of every string in $L$. Specifically, $chop2(L) =$ {$w: vw ∈ L,$ with $|v|= 2$}. Show that if $L$ is regular, then $chop2 (L)$ is also regular.
vaibhav singh 3
asked
in
Theory of Computation
Sep 14, 2018
by
vaibhav singh 3
606
views
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
regular-language
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 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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
