4 citations · 9 across the 9 of their papers we have counts for
1 paper · 1 filter
Paweł Parys
We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphabet. The new automata recognize languages of data words (instead of normal words)…