One-reversal counter machines and multihead automata: revisited
From MaRDI portal
(Redirected from Publication:714812)
Recommendations
Cites work
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 6606353 (Why is no real title available?)
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Hierarchies and Characterizations of Stateless Multicounter Machines
- On Multi-Head Finite Automata
- On computational complexity of graph inference from counting
- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
- On spiking neural P systems and partially blind counter machines
- On stateless multicounter machines
- One-reversal counter machines and multihead automata: revisited
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- Some decision problems concerning semilinearity and commutation.
- String-matching cannot be done by a two-head one-way deterministic finite automaton
Cited in
(30)- scientific article; zbMATH DE number 2038700 (Why is no real title available?)
- Reversible Computations of One-Way Counter Automata
- The effect of end-markers on counter machines and commutativity
- scientific article; zbMATH DE number 1759445 (Why is no real title available?)
- On the intersection of the class of linear context-free languages and the class of single-reset languages
- Reversal-bounded nondeterministic multicounter machines and complementation
- Simulating one-reversal multicounter machines by partially blind multihead finite automata
- Counter machines and crystallographic structures
- Pseudo-inversion: closure properties and decidability
- Input-Position-Restricted Models of Language Acceptors
- The Power of Alternating One-Reversal Counters and Stacks
- One-reversal counter machines and multihead automata: revisited
- scientific article; zbMATH DE number 4007730 (Why is no real title available?)
- scientific article; zbMATH DE number 3885308 (Why is no real title available?)
- scientific article; zbMATH DE number 3982518 (Why is no real title available?)
- On families of full trios containing counter machine languages
- On the intersection of stacks and queues
- Grammatical characterizations of NPDAs and VPDAs with counters
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Notes on looping deterministic two-way pushdown automata
- Automata with modulo counters and nondeterministic counter bounds
- On the density of context-free and counter languages
- Fooling a two-way nondeterministic multihead automaton with reversal number restriction
- scientific article; zbMATH DE number 1418343 (Why is no real title available?)
- On the density of context-free and counter languages
- Reversible computations of one-way counter automata
- On the overlap assembly of strings and languages
- Remarks on two-way automata with weak-counters
- scientific article; zbMATH DE number 3928351 (Why is no real title available?)
- scientific article; zbMATH DE number 3961009 (Why is no real title available?)
This page was built for publication: One-reversal counter machines and multihead automata: revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714812)
