Up a level |
Number of items: 2.
Han, Yo-Sub, Ko, Sang-Ki, Ng, Timothy and Salomaa, Kai
(2017)
Consensus String Problem for Multiple Regular Languages.
.
Cho, Da-Jung, Goč, Daniel ORCID: 0000-0002-8265-4918, Han, Yo-Sub, Ko, Sang-Ki, Palioudakis, Alexandros ORCID: 0000-0003-3181-6072 and Salomaa, Kai
(2017)
State complexity of permutation on finite languages over a binary alphabet.
Theoretical Computer Science, 682.
pp. 67-78.