activity
20102019
most citedEquivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions

11 citations · 25 across the 6 of their papers we have counts for

collaborators
Showing 2011 · cs.DCShow all

1 paper · 2 filters

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 (…