We introduce and investigate tree-walking-storage automata, which are finite-state devices
equipped with a tree-like storage. The automata are generalized stack automata, where the …

It is well known that the “store language” of every pushdown automaton—the set of store
configurations (state and stack contents) that can appear as an intermediate step in …

We study deterministic tree-walking-storage automata, which are finite-state devices
equipped with a tree-like storage. These automata are generalized stack automata, where …

This paper examines several measures of space complexity of variants of stack automata:
non-erasing stack automata and checking stack automata. These measures capture the …

Deterministic pushdown transducers are studied with respect to their ability to compute
reversible transductions, that is, to transform inputs into outputs in a reversible way. This …

Finite state machines are investigated towards their ability to reversibly compute
transductions, that is, to transform inputs into outputs in a reversible way. This means that the …

The store language of a machine of some arbitrary type is the set of all store configurations
(state plus store contents but not input) that can appear in an accepting computation. New …

This paper examines several measures of space complexity on variants of stack automata:
non-erasing stack automata and checking stack automata. These measures capture the …

This position paper presents our initial ideas on using stack transducers for dialogue state
tracking. Stack transducers are abstract devices that translate an input to an output while …

Deterministic pushdown transducers are studied with respect to their ability to compute
reversible transductions, that is, to transform inputs into outputs in a reversible way. This …