839 views
5 votes
5 votes

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
3
adwaitLP asked Sep 13, 2017
2,099 views
If M is a turing machine and Language accepted by that turning machine is L(M) such that L is regular language. Whether this Statement is decidable or undecidable?
0 votes
0 votes
0 answers
4
Mk Utkarsh asked Sep 15, 2018
551 views
A Turing Machine accepts a language if its DCFL but rejects if it's a non deterministic CFL