429 views

Please log in or register to answer this question.

Related questions

2 votes
2 votes
2 answers
1
AnilGoudar asked Jul 17, 2017
687 views
If language L is countable infinite set then, L is Recursive as we can define enumeration method for the countable set.or It can Regular ??
0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
4
Akash Mishra asked Sep 11, 2017
1,116 views
Is this language L accepted by a Turing Machine?L = a1n a2n a3n a4n .........amn || m,n 0Also, what about this language?L = a1n a2n a3n a4n .........ann || n 0