Question
What is meant by computability in Theory of Automata and Formal Languages?
Correct Answer: A
the study of what problems can be solved by algorithmic machines
The correct answer is the study of what problems can be solved by algorithmic machines.
The correct answer is the study of what problems can be solved by algorithmic machines.
Leave a Reply