Author:
Han Yo-Sub,Ko Sang-Ki,Salomaa Kai
Publisher
Springer International Publishing
Reference30 articles.
1. Câmpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7, 303–310 (2002)
2. Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theoret. Comput. Sci. 437, 98–107 (2012)
3. Domaratzki, M.: Deletion along trajectories. Theoret. Comput. Sci. 320, 293–313 (2004)
4. Domaratzki, M., Okhotin, A.: State complexity of power. Theoret. Comput. Sci. 410, 2377–2392 (2009)
5. Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. J. Automata, Languages and Combinatorics 9, 217–232 (2004)