5 research outputs found

    Concatenation of graphs

    Get PDF

    Three hierarchies of transducers

    Get PDF
    Composition of top-down tree transducers yields a proper hierarchy of transductions and of output languages. The same is true for ETOL systems (viewed as transducers) and for two-way generalized sequential machines

    Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs

    Full text link
    Polyregular functions are the class of string-to-string functions definable by pebble transducers (an extension of finite automata) or equivalently by MSO interpretations (a logical formalism). Their output length is bounded by a polynomial in the input length: a function computed by a kk-pebble transducer or by a kk-dimensional MSO interpretation has growth rate O(nk)O(n^k). Boja\'nczyk has recently shown that the converse holds for MSO interpretations, but not for pebble transducers. We give significantly simplified proofs of those two results, extending the former to first-order interpretations by reduction to an elementary property of N\mathbb{N}-weighted automata. For any kk, we also prove the stronger statement that there is some quadratic polyregular function whose output language differs from that of any kk-fold composition of macro tree transducers (and which therefore cannot be computed by any kk-pebble transducer). In the special case of unary input alphabets, we show that kk pebbles suffice to compute polyregular functions of growth O(nk)O(n^k). This is obtained as a corollary of a basis of simple word sequences whose ultimately periodic combinations generate all polyregular functions with unary input. Finally, we study polyregular and polyblind functions between unary alphabets (i.e. integer sequences), as well as their first-order subclasses.Comment: 27 pages, not submitted ye

    Tree transducers, L systems, and two-way machines

    Get PDF
    A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying. Among the parallel rewriting systems considered are the top-down tree transducer; the generalized syntax-directed translation scheme and the ETOL system, and among the two-way machines are the tree-walking automaton, the two-way finite-state transducer, and (generalizations of) the one-way checking stack automaton. The. relationship of these devices to macro grammars is also considered. An effort is made .to provide a systematic survey of a number of existing results
    corecore