Pages that link to "Item:Q1238433"

The following pages link to Sur les rélations rationnelles entre monoides libres (Q1238433):

Displaying 38 items.

• Probabilistic grammars and languages (Q438593) (← links)
• Varieties and rational functions (Q673101) (← links)
• Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
• Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
• Cyclic rational transductions and polynomials of rational functions (Q916404) (← links)
• On bounded rational trace languages (Q970110) (← links)
• An application of the matrix representation of transductions (Q1057659) (← links)
• Deciding the immutability of regular codes and languages under finite transduction (Q1120291) (← links)
• Une topologie du monoide libre (Q1144952) (← links)
• Sur les séries associees à certains systèmes de Lindenmayer (Q1151050) (← links)
• A new proof of two theorems about rational transductions (Q1255326) (← links)
• A construction on finite automata that has remained hidden (Q1275469) (← links)
• On the lengths of values in a finite transducer (Q1323379) (← links)
• Representation of rational functions with prefix and suffix codings (Q1341724) (← links)
• Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers. (Q1426170) (← links)
• Iterated relabeling tree transducers (Q1605311) (← links)
• Visibly pushdown transducers (Q1672009) (← links)
• Iterating transducers (Q1858440) (← links)
• Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
• On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
• Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
• Regular model checking with regular relations (Q2140498) (← links)
• Non-deterministic transducer models of retransmission protocols over noisy channels (Q2346564) (← links)
• Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
• A Disambiguation Algorithm for Finite Automata and Functional Transducers (Q2914715) (← links)
• Nondeterministic Streaming String Transducers (Q3012906) (← links)
• Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
• Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← links)
• (Q3873564) (← links)
• Le théorème de transversale rationnelle dans les langages d'arbres (Q3883537) (← links)
• Cardinality problems of compositions of morphisms and inverse morphisms (Q4203829) (← links)
• Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
• Iteration of rational transductions (Q4508635) (← links)
• Closure under union and composition of iterated rational transductions (Q4522113) (← links)
• (Q5090506) (← links)
• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS (Q5401560) (← links)
• The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)