On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - Information Processing Letters, 2014 - Elsevier
Given a string P of length m over an alphabet Σ of size σ, a swapped version of P is a string
derived from P by a series of local swaps, ie, swaps of adjacent symbols, such that each …

[引用][C] On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - Information Processing Letters, 2014 - researchportal.helsinki.fi
On a compact encoding of the swap automaton — University of Helsinki Skip to main
navigation Skip to search Skip to main content University of Helsinki Home University of …

On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - Information Processing Letters, 2014 - dl.acm.org
Given a string P of length m over an alphabet@ S of size@ s, a swapped version of P is a
string derived from P by a series of local swaps, ie, swaps of adjacent symbols, such that …

On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - arXiv e-prints, 2013 - ui.adsabs.harvard.edu
Given a string $ P $ of length $ m $ over an alphabet $\Sigma $ of size $\sigma $, a
swapped version of $ P $ is a string derived from $ P $ by a series of local swaps, ie, swaps …

On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - arXiv preprint arXiv:1307.0099, 2013 - arxiv.org
Given a string $ P $ of length $ m $ over an alphabet $\Sigma $ of size $\sigma $, a
swapped version of $ P $ is a string derived from $ P $ by a series of local swaps, ie, swaps …

On a compact encoding of the swap automaton

K Fredriksson, E Giaquinta - Information Processing Letters, 2014 - infona.pl
Given a string P of length m over an alphabet Σ of size σ, a swapped version of P is a string
derived from P by a series of local swaps, ie, swaps of adjacent symbols, such that each …