Directed acyclic word graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Directed acyclic word graph may refer to two related, but distinct, automata constructions in computer science: