Closure Property of Regular Language (Quotient)

Raveen Sharma asked Jul 28, 2016 • retagged Jun 4, 2017 by Arjun

823 views

3 votes

Can anyone explain me How Regular languages closed under left or right quotient.

Theory of Computation
theory-of-computation
regular-language

+ –

Raveen Sharma asked Jul 28, 2016 • retagged Jun 4, 2017 by Arjun

Raveen Sharma

823 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

Solution of your question directly from peter linz book

Aboveallplayer answered Jul 31, 2016

Aboveallplayer

See all

1 1 comment

Raveen Sharma

commented Aug 3, 2016

Can you explain me. i am not getting what is written in pic.

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

Shubhanshu asked Jul 2, 2017

1,272 views

clouser property of regular language
What is the difference between substitution property, homomorphism property and inverse homomorphism property? Give an example to best support your answer.

What is the difference between substitution property, homomorphism property and inverse homomorphism property?Give an example to best support your answer.

Shubhanshu

1.3k views

Shubhanshu asked Jul 2, 2017

Theory of Computation
theory-of-computation
regular-language
closure-property

+ –

1 votes

1 answer

raviyogi asked Dec 30, 2017

690 views

closure property
CFL over a single alphabet are always-> A. dcfl B. regular C. dcfl but not regular d. non regular

CFL over a single alphabet are always->A. dcflB. regularC. dcfl but not regulard. non regular

raviyogi

690 views

raviyogi asked Dec 30, 2017

Theory of Computation
theory-of-computation
context-free-language
closure-property
regular-language

+ –

0 votes

1 answer

sumit chakraborty asked Nov 29, 2017

557 views

TOC closure property doubt
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ? My doubt is that since L2 is a regular language and L1 is CFL and L2 will contain all strings in L1, so ... ). Complement of regular is regular and intersection of CFL with regular is closed and the language will be CFL. Which one is right and why ?

If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ?My doubt is that since L2 is a regular language...

sumit chakraborty

557 views

sumit chakraborty asked Nov 29, 2017

Theory of Computation
theory-of-computation
closure-property
context-free-language
regular-language

+ –

2 votes

1 answer

Shubhanshu asked Oct 31, 2017

1,682 views

DFA for Right Quotient of Regular Languages
For drawing the DFA for right quotient I have referred following link:- Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html But unable to get the dfa for the following language Its answer is c, and got that too using manual checking. but facing difficulty in drawing DFA for it.

For drawing the DFA for right quotient I have referred following link:-Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.htmlBut unable to get the dfa for the...

Shubhanshu

1.7k views

Shubhanshu asked Oct 31, 2017

Theory of Computation
theory-of-computation
regular-language
finite-automata

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

0

1 1 comment