1.whether Turing machine halt for Regular langauage or not?
2.Whether Turing maching halt for Context free Language or not?
3.Discuss the difference between Turing-recognizable and decidable languages.
4.provideONEexample of a language that is undecidable andONEexample of a language that is not Turing-recognizable.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here