Register

Self doubt

• edited by
284 views
1 votes
1 votes

Please provide suggestions for following points-

  1. Can Type-0 grammar be written for a Regular Language which is not Type 1,2 or 3.
  2. Can any Type 0 grammar be checked if it can be reduced to Type 1,2,3 grammar.
  3. how to check if a Type 0 grammar  is decidable /undecidable
  4. How to design a turing machine by looking at Type 0 grammar
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
3
Vegeta asked Jul 24, 2018
661 views
self doubt
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
User Avatar
Link Copied!