next up previous
Next: Lookup by Binary Search Up: Automaton Representations Previous: Hashing table

Arrays

In this representation, we store the outgoing transitions of a state in an array of couples in $\Sigma \times Q$. We have three ways to manage it.

 

Vincent Lemaout
12/9/1997