-
Notifications
You must be signed in to change notification settings - Fork 0
/
DFA.java
61 lines (40 loc) · 1.08 KB
/
DFA.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
package dfa.utils;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class DFA<I, O> {
private DFAState<I, O> root;
public DFA(DFAState<I, O> root) {
this.root = root;
}
public O getOutput(List<I> input) {
DFAState<I, O> curr = root;
for (I in : input) {
if (curr.getTransitions().contains(in)) {
curr = curr.getDestination(in);
} else {
return null;
}
}
return curr.getOutput();
}
public int computeSize() {
return getAllStates(root, new HashSet<>()).size();
}
private Set<DFAState<I, O>> getAllStates(DFAState<I, O> curr, Set<DFAState<I, O>> visited) {
visited.add(curr);
for (I in : curr.getTransitions()) {
DFAState<I, O> next = curr.getDestination(in);
if(!visited.contains(next))
visited.addAll(getAllStates(next, visited));
}
return visited;
}
public DFAState<I, O> getRoot() {
return root;
}
public void print() {
root.print();
}
public String test = "";
}