Two-way counter machines and finite-state transducers†
From MaRDI portal
Publication:3680282
DOI10.1080/00207168508803465zbMATH Open0565.68049OpenAlexW2001899823MaRDI QIDQ3680282FDOQ3680282
Authors: Eitan M. Gurari 
Publication date: 1985
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168508803465
Recommendations
decidabilityequivalence problememptiness problembounded-reversal counterdeterministic two-way finite-state automatadeterministic two-way finite-state transducers
Cites Work
- Reversal-bounded multipushdown machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Title not available (Why is that?)
- 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)
- On two-way transducers
- On the containment and equivalence problems for two-way transducers
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Prefix and equality languages of rational functions are co-context-free
- Title not available (Why is that?)
- On decision problems for parameterized machines
- On some transducer equivalence problems for families of languages
- Transducing reversibly with finite state machines
- A note on Parikh maps, abstract languages, and decision problems
- On two-way nondeterministic finite automata with one reversal-bounded counter
- Title not available (Why is that?)
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)
