Authors: GLOBERMAN N HAREL D

Citation: N. Globerman et D. Harel, COMPLEXITY RESULTS FOR 2-WAY AND MULTI-PEBBLE AUTOMATA AND THEIR LOGICS, Theoretical computer science, 169(2), 1996, pp. 161-184