Complex sentence: A Boolean function can be represented as a rooted, directed, acyclic graph, which consists of several decision nodes and two terminal nodes called 0-terminal and 1-terminal.
Split into simpler sentences: A Boolean function can be represented as a rooted, directed, acyclic graph, which consists of several decision nodes and terminal nodes. There are two types of terminal nodes called 0-terminal and 1-terminal.