432 views
1 votes
1 votes
I have a doubt regarding the dilemma of semidecidable and undecidable..

We have 8 standard properties and considering each class of language:

a) Membership

b) Finiteness

c) Emptiness

d) Ambiguity

e) Regularity

f) Equivalence

g) Kleene's Closureness

h) Disjointedness..

In general if for a given class of language one of the above mentioned properties fail , then do we say the problem is semidecidable or undecidable for a class of language under that particular operation??

@Arjun sir,plz help me resolving this doubt..It would be helpful of other aspirants as well..

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
agoh asked Dec 9, 2016
306 views
Are these 2 problems different?1. Given grammar G, is G regular?2. Given grammar G, is L(G) regular?Which of these 2 are decidable?