Hiding pebbles when the output alphabet is unary

TL;DR

This paper investigates the computational capabilities of pebble and blind transducers with unary output alphabet, providing decision procedures and characterizations for when pebble transducer functions can be simulated by blind transducers.

Contribution

It introduces methods to decide if pebble transducer functions are computable by blind transducers and offers new characterizations using rational series concepts.

Findings

Decidable criteria for pebble to blind transducer function equivalence

Characterizations of these classes via Cauchy and Hadamard products

Pumping-like properties of functions computed by blind transducers

Abstract

Pebble transducers are nested two-way transducers which can drop marks (named "pebbles") on their input word. Blind transducers have been introduced by Nguy\^en et al. as a subclass of pebble transducers, which can nest two-way transducers but cannot drop pebbles on their input. In this paper, we study the classes of functions computed by pebble and blind transducers, when the output alphabet is unary. Our main result shows how to decide if a function computed by a pebble transducer can be computed by a blind transducer. We also provide characterizations of these classes in terms of Cauchy and Hadamard products, in the spirit of rational series. Furthermore, pumping-like characterizations of the functions computed by blind transducers are given.