NSA

Nested stack automata. Can recognize indexed languages $\{a^nb^nc^n | n \geq 0\}$

See:

• Nested Stack Automata, 1969 by A.V. Aho
• On groups whose word problem is solved by a nested stack automaton, 1998, Robert Gilman, Michael Shapiro
• New Results on Context-Free Tree Languages