Abstract
We present a constructive variant of the Hennie machine. It is demonstrated how it can facilitate the design of finite-state machines. We focus on the deterministic version of the model and study its descriptional complexity. The model's succinctness is compared with common devices that include the nondeterministic finite automaton, two-way finite automaton and pebble automaton. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Průša, D. (2014). Weight-reducing Hennie machines and their descriptional complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 553–564). https://doi.org/10.1007/978-3-319-04921-2_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
