5 citations · 9 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2013
On a compact encoding of the swap automaton
Kimmo Fredriksson, Emanuele Giaquinta
Given a string of length over an alphabet of size , a swapped version of is a string derived from by a series of local swaps, i.e., swaps of adjacent symbols…
cs.FL2010
On building minimal automaton for subset matching queries
Kimmo Fredriksson
We address the problem of building an index for a set of strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer…