java dfa_给出描述Java表达式的DFA~~~~~~~~~~在线等

展开全部

这是DFA算法，自己设定好值，看下结果

import java.util.*;

import java.io.*;

class DFA

{

boolean recognizeString(int move[][], int accept_state[], String word)

{

int s=0;

for (int i = 0; i

{

char c = word.charAt(i);

s = move[s][c - 'a'];

}

for (int j = 0; j < accept_state.length; j++)

if (s == accept_state[j]) 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());

n = Integer.parseInt(st.nextToken());

m = Integer.parseInt(st.nextToken());

while (n !e68a84e8a2ad3231313335323631343130323136353331333335313230= 0)

{

int[][] move = new int[n][m];

for(int i=0; i

{

st = new StringTokenizer(in.readLine());

for (int j=0; j

move[i][j] = Integer.parseInt(st.nextToken());

}

String[] temp = in.readLine().split("\\s");

int[] accept = new int[temp.length];

for (int i=0; i

String word = in.readLine();

while (word.compareTo("#") != 0)

{

DFA dfa = new DFA();

if (dfa.recognizeString(move, accept, word)) System.out.println("YES"); else System.out.println("NO");

word = in.readLine();

}

st = new StringTokenizer(in.readLine());

n = Integer.parseInt(st.nextToken());

m = Integer.parseInt(st.nextToken());

}

}

}