The state complexity of permutations on finite languages over binary alphabets

Alexandros Palioudakis, Da Jung Cho, Daniel Goč, Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Fingerprint Dive into the research topics of 'The state complexity of permutations on finite languages over binary alphabets'. Together they form a unique fingerprint.

Mathematics