Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
From MaRDI portal
(Redirected from Publication:2969980)
Recommendations
Cites work
- An algebraic characterization of unary two-way transducers
- Elements of automata theory. Translated from the French by Reuben Thomas
- From two-way to one-way finite state transducers
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 177806 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- MSO definable string transductions and two-way finite-state transducers
- One-way definability of sweeping transducer
- Rational sets in commutative monoids
- Sequences of words defined by two-way transducers
- Tropical Two-Way Automata
- Two Families of Languages Related to ALGOL
- Uniformisation of two-way transducers
Cited in
(4)
This page was built for publication: Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969980)