Recent questions tagged identify-class-language

1 votes
1 answer
31
If every string of a language can be determined, whether it is legal or illegal in finite time, the language is calleddecidableundecidableinterpretivenon-deterministic
0 votes
1 answer
32
1 votes
2 answers
40
1 votes
1 answer
41
$L=\{wxyw|w,x,y\in (a+b)^+ \}$$L$ is ?RegularDeterministic CFLNon-deterministic CFLCSL
1 votes
2 answers
42
0 votes
1 answer
44
Please suggest me in briefly for revision .How to we test regular,dcfl,cfl,recursive and recursive enumeranle.Eg say if we can find the pattern it's regular.Please help...
0 votes
0 answers
48