Author:
Han Yo-Sub,Ko Sang-Ki,Salomaa Kai
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference37 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. Cho, D.-J., Han, Y.-S., Ko, S.-K., Salomaa, K.: State complexity ofinversion operations. In: Proceedings of the DCFS 2014. Lecture Notes in Computer Science, vol. 8614. Springer, Berlin, pp. 102–113 (2014)
3. Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theor. Comput. Sci. 437, 98–107 (2012)
4. Domaratzki, M.: Deletion along trajectories. Theor. Comput. Sci. 320, 293–313 (2004)
5. Domaratzki, M., Okhotin, A.: State complexity of power. Theor. Comput. Sci. 410, 2377–2392 (2009)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献