From what I know,
- a problem can be transformed to a yes/no answer, which can be described by a decision tree.
- Solution to a problem also can be represented by a set of strings (a language), which means the problem can be regarded as a membership problem.
- This set of strings can also be represented by an automaton, although how it is done is still vague in my mind.
My questions are:
What is the relationship between a decision tree and an automaton?
How to convert a decision tree to an automaton?
I have tried to read some articles related to this, and somehow 'know' these concepts are related with each other, but still feel that I don't quite understand the relation and how to convert them to each other.