Weight-Reducing Hennie Machines and Their Descriptional Complexity
From MaRDI portal
Publication:5404943
DOI10.1007/978-3-319-04921-2_45zbMath1407.68266OpenAlexW291909571MaRDI QIDQ5404943
Publication date: 31 March 2014
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_45
Related Items (13)
Deterministic Ordered Restarting Automata that Compute Functions ⋮ Reversible Limited Automata ⋮ Weight-reducing Turing machines ⋮ Descriptional complexity of limited automata ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Linear-time limited automata ⋮ Reversibility for stateless ordered RRWW-automata ⋮ On Ordered RRWW-Automata ⋮ Reversible Ordered Restarting Automata ⋮ On Simulation Cost of Unary Limited Automata ⋮ On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata ⋮ Two-dimensional Sgraffito automata ⋮ Converting nondeterministic two-way automata into small deterministic linear-time machines
This page was built for publication: Weight-Reducing Hennie Machines and Their Descriptional Complexity
