使用Thompson与子集构造法：从正则到DFA实战指南

import java.util.*;   
import java.io.*;   
   
class DFA   
{   
    boolean recognizeString(int move[][], int accept_state[], String word)   
    {   
                int step = 0;   
                char temp;   
                int i;   
                for(i = 0; i < word.length(); i++)   
                {   
                        int j = 0;   
                        temp = word.charAt(i);   
                        j = temp - 'a';   
                        step = move[step][j];                        
                }   
                for(i = 0; i < accept_state.length; i++)   
                {   
                        if(step == accept_state[i])   
                               return true;   
                }   
                return false;   
    }   
    public static void main(String args[]) throws IOException   
    {   
        int n, m;   
        BufferedReader in = new BufferedReader(new FileReader("DFA.in"));   
        StringTokenizer st = new StringTokenizer(in.readLine());