We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words. that is. pushdown automata whose nondeterminism can be resolved based on the run constructed so far. but independently of the remainder of the input word. https://thebrickes.shop/product-category/patio-heaters/