Pages that link to "Item:Q4406290"
From MaRDI portal
The following pages link to MSO definable string transductions and two-way finite-state transducers (Q4406290):
Displaying 43 items.
- Sequences of words defined by two-way transducers (Q728270) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Query automata over finite trees (Q1607226) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Finite transducers and rational transductions (Q2074205) (← 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)
- Computability by monadic second-order logic (Q2656341) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Regular Transformations of Data Words Through Origin Information (Q2811346) (← links)
- Both Ways Rational Functions (Q2817380) (← links)
- Aperiodic String Transducers (Q2817381) (← links)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts (Q2969980) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- (Q3386623) (← links)
- (Q4611380) (← links)
- Aperiodic String Transducers (Q4683232) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- On the Complexity of Infinite Advice Strings (Q5002808) (← links)
- (Q5009457) (← links)
- (Q5089180) (← links)
- Register Transducers Are Marble Transducers (Q5089194) (← links)
- (Q5090448) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- (Q5091268) (← links)
- (Q5092324) (← links)
- (Q5092330) (← links)
- (Q5376652) (← links)
- From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
- Weighted two-way transducers (Q6145527) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- Transducers of polynomial growth (Q6649429) (← links)
- Efficient construction of reversible transducers from regular transducer expressions (Q6649485) (← links)
- Attributed tree transducers for partial functions (Q6666800) (← links)
