Pages that link to "Item:Q2908833"

The following pages link to Expressiveness of Streaming String Transducers (Q2908833):

Displaying 26 items.

• On the containment and equivalence problems for two-way transducers (Q418777) (← links)
• Regular transducer expressions for regular transformations (Q2064527) (← links)
• Regular model checking with regular relations (Q2140498) (← links)
• One-way resynchronizability of word transducers (Q2233399) (← links)
• Streamable regular transductions (Q2286735) (← links)
• Normality and two-way automata (Q2343136) (← links)
• Non-deterministic transducer models of retransmission protocols over noisy channels (Q2346564) (← links)
• Complexity of regular functions (Q2424670) (← links)
• Regular Transformations of Data Words Through Origin Information (Q2811346) (← links)
• Aperiodic String Transducers (Q2817381) (← links)
• Nondeterministic Streaming String Transducers (Q3012906) (← links)
• (Q4611380) (← links)
• Aperiodic String Transducers (Q4683232) (← links)
• Copyful Streaming String Transducers (Q4989167) (← links)
• On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers (Q5021109) (← links)
• Register Transducers Are Marble Transducers (Q5089194) (← links)
• (Q5089228) (← links)
• (Q5090448) (← links)
• Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
• (Q5090989) (← links)
• (Q5092324) (← links)
• (Q5092330) (← links)
• On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
• Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
• From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
• Streaming ranked-tree-to-string transducers (Q5918275) (← links)