Automata Theory Questions
A two-way finite automaton is a type of automaton that can move its head both left and right on the input tape. It consists of a finite set of states, an input tape, a head that can read and write symbols on the tape, and a transition function that determines the next state and head movement based on the current state and the symbol being read. This type of automaton is more powerful than a one-way finite automaton as it can make decisions based on both past and future input symbols.