Register

own doubt

389 views
0 votes
0 votes
can we say that every regular language is a DCFL?
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
2
Nandkishor3939 asked Jan 22, 2019
475 views
RL and DCFL
the answer is given that the statement 2 is correct? But how… even if we create a DCFL by final state condition like : q(b,z0| z0)-→ final state ,q(null,a|z0) ----→ final state [Thats what was mentioned in the video solution] it will accept the string aab
the answer is given that the statement 2 is correct?But how…even if we create a DCFL by final state condition like :q(b,z0| z0)-→ final state ,q(null,a|z0) → f...
User Avatar
0 votes
0 votes
1 answer
4
Rahul Jain25 asked Feb 7, 2017
827 views
Decidablity+DCFL
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not??? II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducible to L2 and L1 is non-RE then L2 is also non-RE??
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not???II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducibl...
User Avatar
Link Copied!