In computer science, a pebble automaton is an extension of tree walking automata which allows the automaton to use a finite amount of "pebbles", used for marking tree node. The result is a model stronger than ordinary tree walking automata, but still strictly weaker than branching automata.
Read more about Pebble Automaton: Definitions, Properties, Automata and Logic, See Also
Famous quotes containing the word pebble:
“I do not know what I may appear to the world; but to myself I seem to have been only like a boy playing on the seashore, and diverting myself in now and then finding a smoother pebble or a prettier shell than ordinary, whilst the great ocean of truth lay all undiscovered before me.”
—Isaac Newton (1642–1727)