How can we know what language a certain RE represent-00934
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: How can we know, what language a certain RE represent
Answer:
TGs and GTGs provide certain relaxations i.e. there may exist more than one path for a certain string or there may not be any path for a certain string, this property creates nondeterminism and it can also help in differentiating TGs or GTGs from FAs. Hence an FA is also called a Deterministic Finite Automaton (DFA). (Page 25)
