Publisher
Springer International Publishing
Reference16 articles.
1. Guillon, B., Prigioniero, L.: Linear-time limited automata. Theor. Comput. Sci. 798, 95–108 (2019)
2. Hibbard, T.N.: A generalization of context-free determinism. Inf. Control 11(1/2), 196–238 (1967)
3. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
4. Jirásková, G., Okhotin, A.: On the state complexity of operations on two-way finite automata. Inf. Comput. 253, 36–63 (2017). https://doi.org/10.1016/j.ic.2016.12.007
5. Kunc, M., Okhotin, A.: State complexity of union and intersection for two-way nondeterministic finite automata. Fundamenta Informaticae 110(1–4), 231–239 (2011). https://doi.org/10.3233/FI-2011-540
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献