We investigate the state complexity of the permutation operation over finite binary languages. We first give an upper bound of the state complexity of the permutation operation for a restricted case of these languages. We later present a general upper bound of the state complexity of permutation over finite binary languages, which is asymptotically the same as the previous case. Moreover, we show that there is a family of languages that the minimal DFA recognizing each of these languages needs at least as many states as the given upper bound for the restricted case. Furthermore, we investigate the state complexity of permutation by focusing on the structure of the minimal DFA.
|Title of host publication||Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Proceedings|
|Editors||Alexander Okhotin, Jeffrey Shallit|
|Number of pages||11|
|Publication status||Published - 2015|
|Event||17th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2015 - Waterloo, Canada|
Duration: 2015 Jun 25 → 2015 Jun 27
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||17th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2015|
|Period||15/6/25 → 15/6/27|
Bibliographical noteFunding Information:
This research was supported by the Basic Science Research Program through NRF funded by MEST (2012R1A1A2044562), the International Cooperation Program managed by NRF of Korea (2014K2A1A2048512) and the Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.
© Springer International Publishing Switzerland 2015.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)