Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa. State complexity of permutation on finite languages over a binary alphabet. Theoretical Computer Science, 682:67-78, 2017. [doi]
@article{ChoGHKPS17,
title = {State complexity of permutation on finite languages over a binary alphabet},
author = {Da-Jung Cho and Daniel Goc and Yo-Sub Han and Sang-Ki Ko and Alexandros Palioudakis and Kai Salomaa},
year = {2017},
doi = {10.1016/j.tcs.2017.03.007},
url = {https://doi.org/10.1016/j.tcs.2017.03.007},
researchr = {https://researchr.org/publication/ChoGHKPS17},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {682},
pages = {67-78},
}