The following pages link to A general theory of translation (Q5563368):
Displayed 20 items.
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- On determinism versus nondeterminism for restarting automata (Q948093) (← links)
- Query automata over finite trees (Q1607226) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Complexity and categoricity of injection structures induced by finite state transducers (Q2117771) (← links)
- Normality and two-way automata (Q2343136) (← links)
- Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
- The many faces of a translation (Q2581761) (← links)
- Construction of an effective algorithm to find the isomorphism of two simple finite semigroups (Q3787485) (← links)
- (Q4611380) (← links)
- Three hierarchies of transducers (Q4747534) (← links)
- A syntax directed macro processor (Q4775457) (← links)
- (Q4988165) (← links)
- (Q5090448) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- (Q5092330) (← links)
- Characterizations of transductions defined by abstract families of transducers (Q5626546) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Transducing reversibly with finite state machines (Q5920055) (← links)
- Abstract families of relations (Q5921426) (← links)