So the storage structure of finite automaton should the choosed adjacency lists.
So the storage structure of finite automaton should the choosed adjacency lists.
所以，有穷自动机的存储结构最好采用邻接链表来存储。
So the storage structure of finite automaton should the choosed adjacency lists.
所以，有穷自动机的存储结构最好采用邻接链表来存储。