Arrow Research search
Back to TCS

TCS 2003

From bidirectionality to alternation

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on finite words, and extend it to automata on infinite words.

Authors

Keywords

  • Two-way automata
  • Nondeterministic finite automata
  • Nondeterministic Büchi automata
  • Alternating finite automata
  • Alternating Büchi automata

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
19788892578043109
v2026.09.13