| Iterative arrays are one-dimensional arrays of interconnected interacting finite automata. The cell at the origin is equipped with a one-way read-only input tape. We consider iterative arrays as transducers. To this end, the cell at the origin is additionally equipped with a one-way write-only output tape. The families of transductions computed are classified with regard to the time allowed to compute the input and the output, respectively. In detail, the time complexities of real-time and linear-time are of particular interest, for which a proper hierarchy is shown. In the second part of the paper, iterative array transducers are compared with the conventional transducer models, namely, finite state transducers and pushdown transducers. It turns out that all deterministic variants can be simulated by iterative array transducers. Moreover, nondeterministic but unambiguous finite state transducers can be simulated as well. When considering time constraints, incomparability results to almost all families are derived. |
Récupérer au format
