Sur les rélations rationnelles entre monoides libres
From MaRDI portal
Publication:1238433
DOI10.1016/0304-3975(76)90026-8zbMath0358.68129OpenAlexW2004367544MaRDI QIDQ1238433
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90026-8
Related Items
Closure under union and composition of iterated rational transductions, Visibly Pushdown Transducers with Look-Ahead, Representation of rational functions with prefix and suffix codings, Regular model checking with regular relations, A Disambiguation Algorithm for Finite Automata and Functional Transducers, Deciding the immutability of regular codes and languages under finite transduction, Equivalence of finite-valued tree transducers is decidable, Visibly pushdown transducers, Unnamed Item, Une topologie du monoide libre, Identities and transductions, Sur les séries associees à certains systèmes de Lindenmayer, Probabilistic grammars and languages, Cyclic rational transductions and polynomials of rational functions, Lexicographic decomposition of \(k\)-valued transducers, On the representation of finite deterministic 2-tape automata, Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers., The Equivalence Problem of Finite Substitutions on ab*c, with Applications, Varieties and rational functions, ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS, Nondeterministic Streaming String Transducers, Single-valuedness of tree transducers is decidable in polynomial time, Equations over finite sets of words and equivalence problems in automata theory, On bounded rational trace languages, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Unnamed Item, Le théorème de transversale rationnelle dans les langages d'arbres, A new proof of two theorems about rational transductions, Series which are both max-plus and min-plus rational are unambiguous, Finite sequentiality of unambiguous max-plus tree automata, A construction on finite automata that has remained hidden, Cardinality problems of compositions of morphisms and inverse morphisms, Decomposing a $k$-valued transducer into $k$ unambiguous ones, An application of the matrix representation of transductions, Iterating transducers, Non-deterministic transducer models of retransmission protocols over noisy channels, Iteration of rational transductions, Iterated relabeling tree transducers, On the lengths of values in a finite transducer
Cites Work
