Input-Position-Restricted Models of Language Acceptors
From MaRDI portal
Publication:5112180
DOI10.1007/978-3-319-73216-9_17zbMath1434.68158OpenAlexW2788443823MaRDI QIDQ5112180
Oscar H. Ibarra, Ian McQuillan
Publication date: 28 May 2020
Published in: Reversibility and Universality (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-73216-9_17
Formal languages and automata (68Q45) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Unnamed Item
- The effect of end-markers on counter machines and commutativity
- On the containment and equivalence problems for two-way transducers
- One-reversal counter machines and multihead automata: revisited
- The complexity of decision problems for finite-turn multicounter machines
- On store languages of language acceptors
- Some decision problems concerning semilinearity and commutation.
- Deletion operations on deterministic families of automata
- Deterministic Stack Transducers
- BOUNDED PARIKH AUTOMATA
- One-Reversal Counter Machines and Multihead Automata: Revisited
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Visibly Pushdown Automata and Transducers with Counters
- Affine Parikh automata
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Deterministic context free languages
