Register

Ace Test Series: Theory Of Computation - Closure Property

• edited by
379 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
3
Na462 asked Jan 13, 2019
1,046 views
MadeEasy Subject Test 2019: Theory of Computation - Closure Property
Consider the following Statements : There Exist a non-deterministic CFL whose reversal is DCFL. There exist a non regular CSL whose Kleene Closure is regular. Which of following are True ? Explain with reasons.
Consider the following Statements :There Exist a non-deterministic CFL whose reversal is DCFL.There exist a non regular CSL whose Kleene Closure is regular.Which of follo...
User Avatar
0 votes
0 votes
2 answers
4
Dhoomketu asked May 10, 2018
590 views
Theory of computation - Closure Property
Cfl is closed under intersection with regular language. Then resultant languages will be regular or cfl ? Let X is cfl Y is regular language L=X intersection Y Then L is what?
Cfl is closed under intersection with regular language.Then resultant languages will be regular or cfl ?Let X is cflY is regular language L=X intersection YThen L is what...
User Avatar
Link Copied!