11 citations · 25 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 11 cited
Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions
Steven Linton, James Propp, Tom Roby +1
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our mo…
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 (…