Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre. Madhusudan. and Parlato. https://storeanimalwiz.shop/product-category/tick-shampoos/