Choffrut, Christian; Pelibossian, Hratchia; Simonnet, Pierre Decision issues on functions realized by finite automata. (English) Zbl 0943.68106 J. Autom. Lang. Comb. 4, No. 3, 171-181 (1999). Summary: Consider a numeration system and a finite set of symbols. Each finite (resp. infinite) sequence on this set represents an integer (resp. a real). Synchronous two-tape automata are devices that define a sequence-to-sequence mapping and can thus be interpreted as performing a relation on integers (resp. reals).Given a numeration system belonging to some natural family defined in this paper and a synchronous two-tape automaton, we show that the following questions are decidable in polynomial time: whether the relation is a function and if this is the case whether it is monotone, injective, continuous (for the reals). Cited in 1 Document MSC: 68Q45 Formal languages and automata Keywords:synchronous two-tape automata; numeration system PDFBibTeX XMLCite \textit{C. Choffrut} et al., J. Autom. Lang. Comb. 4, No. 3, 171--181 (1999; Zbl 0943.68106)