Author:
Martynova Olga,Okhotin Alexander
Publisher
Springer Nature Switzerland
Reference11 articles.
1. Lecture Notes in Computer Science;L Alpoge,2011
2. Lecture Notes in Computer Science;D Chistikov,2016
3. Dobronravov, E., Dobronravov, N., Okhotin, A.: On the length of shortest strings accepted by two-way finite automata. Fundam. Informaticae 180(4), 315-331 (2021). https://doi.org/10.3233/FI-2021-2044
4. Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Automata Lang. Comb. 10(4), 407-437 (2005). https://doi.org/10.25596/jalc-2005-407
5. Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: Proceedings of Non-Classical Models for Automata and Applications (NCMA 2013) Umeå, Sweden, 13–14 August 2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献