Assertion: acyclic graph | /r/HasProperty | viewed as compressed form of tries
Facets:
Source sentences:
text: Just as directed acyclic word graphs can be viewed as a compressed form of tries, binary decision diagrams can be viewed as compressed forms of decision trees that save space by allowing paths to rejoin when they agree on the results of all remaining decisions.