From Bidirectionality to Alternation

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.

• Type: Conference
• Year: 2001
• Where: MFCS
• Authors: Nir Piterman, Moshe Y. Vardi
• Keywords: 1-way Alternating Automata, 2-way Nondeterministic Automata, MFCS 2001, Quadratic Blow-up, Theoretical Computer Science