Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
Automata for the commutative closure of regular sets
Verónica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham
Consider , the free monoid generated by the finite alphabet with the concatenation operation. Two words have the same commutative image when one is a permutation of the…
cs.FL2024
On Shuffling and Splitting Automata
Ignacio Mollo Cunningham
We consider a class of finite state three-tape transducers which models the operation of shuffling and splitting words. We present them as automata over the so-called Shuffling Mon…