If a language can be accepted by an FA then it can be accepted-00935
This subjective question is related to the book/course
vu cs601 Data Communication.
It can also be found in
vu cs601 Mid Term Solved Past Paper No. 2.
Question 1: If a language can be accepted by an FA then it can be accepted by a TG as well.
What are the other two statements of kleenes's theorem?
If a language can be expressed by a RE then it can be accepted by an FA as well.
What are the other two statements of kleenes's theorem?
Answer:
If a language can be accepted by a TG then it can be expressed by an RE as well.If a language can be expressed by a RE then it can be accepted by an FA as well.
