Sign Up to like & get
recommendations!
0
Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9821-6
Abstract: In this work we introduce a notion of independence based on finite-state automata: two infinite words are independent if no one helps to compress the other using one-to-one finite-state transducers with auxiliary input. We prove…
read more here.
Keywords:
state;
finite state;
state independence;