Lifting query complexity to time-space complexity for two-way finite automata

Shenggen Zheng, Yaqiao Li, Minghua Pan +2

Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique ha…