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
. We have three ways to manage it.
Lookup by Binary Search
Linear Search : the Move-To-Front Method
Linear Search : the Transpose Method
Vincent Lemaout
12/9/1997