Two-way counter machines and finite-state transducers†
From MaRDI portal
Publication:3680282
decidabilityequivalence problememptiness problembounded-reversal counterdeterministic two-way finite-state automatadeterministic two-way finite-state transducers
Recommendations
Cites work
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- Two-Way Counter Machines and Diophantine Equations
- Two-way sequential transductions and stack automata
Cited in
(11)- A note on Parikh maps, abstract languages, and decision problems
- On the containment and equivalence problems for two-way transducers
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- scientific article; zbMATH DE number 1929941 (Why is no real title available?)
- On two-way transducers
- On two-way nondeterministic finite automata with one reversal-bounded counter
- Prefix and equality languages of rational functions are co-context-free
- On decision problems for parameterized machines
- On some transducer equivalence problems for families of languages
- Transducing reversibly with finite state machines
- scientific article; zbMATH DE number 3976383 (Why is no real title available?)
This page was built for publication: Two-way counter machines and finite-state transducers†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680282)
