The single-use restriction for register automata and transducers over
infinite alphabets
The single-use restriction for register automata and transducers over
infinite alphabets
This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have the side effect of destroying its contents. This constraint results in robust classes of languages and transductions. For automata models, we show that one-way register …