Publisher
Springer International Publishing
Reference22 articles.
1. Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is Valiant’s parser. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 98–117 (2015)
2. Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29(1), 81–102 (1999)
3. Birget, J.C.: Concatenation of inputs in a two-way automaton. Theor. Comput. Sci. 63(2), 141–156 (1989)
4. Birman, A., Ullman, J.D.: Parsing algorithms with backtrack. In: 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), pp. 153–174 (1970)
5. Cook, S.A.: Linear time simulation of deterministic two-way pushdown automata. University of Toronto, Department of Computer Science (1970)