Publisher
Springer International Publishing
Reference18 articles.
1. Birget, J.: State-complexity of finite-state devices, state compressibility and incompressibility. Math. Syst. Theory 26, 237–269 (1993). https://doi.org/10.1007/BF01371727
2. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295, 189–203 (2003)
3. Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Inf. Comput. 205, 1173–1187 (2007)
4. Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: NCMA (2013)
5. Jirásek, J., Jirásková, G., Sebej, J.: Operations on unambiguous finite automata. Int. J. Found. Comput. Sci. 29, 861–876 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献