As a result , this does not make the automaton more powerful , but is a convenient abstraction .
This capability can be emulated by storing the lookahead buffer contents in the finite state space , since both buffer and input alphabet are finite in size .
This does not make the automaton more powerful , but is a convenient abstraction .
This capability can be emulated by storing the lookahead buffer contents in the finite state space , since both buffer and input alphabet are finite in size .