Two-way deterministic finite automata are exponentially more succinct than sweeping automata
scientific article; zbMATH DE number 3738926