most citedFinding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks

8 citations · 8 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2011★ 8 cited

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks

Vlad Slavici, Daniel Kunkle, Gene Cooperman +1

Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (…