@INPROCEEDINGS{Pru14lata,
  author = {Daniel Průša},
  title = {Weight-Reducing Hennie Machines and Their Descriptional Complexity},
  booktitle = {LATA 2014: Proceedings of the 8th International Conference on Language
    and Automata Theory and Applications},
  year = {2014},
  editor = {Dediu, Adrian Horia and Martín-Vide, Carlos and Sierra-Rodríguez,
    José Luis and Truthe, Bianca},
  volume = {8370},
  series = {Lecture Notes in Computer Science},
  pages = {553--564},
  address = {Berlin, Heidelberg},
  month = {March},
  publisher = {Springer},
  affiliation = {13133},
  annote = {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 d eterministic version of the model and study its descriptional
    complexity. The model's suc cinctness is compared with common devices
    that include the nondeterministic finite automa ton, two-way finite
    automaton and pebble automaton.},
  book_pages = {614},
  day = {10--14},
  is = { zkontrolovano 29 May 2014 },
  isbn = {978-3-319-04920-5},
  keywords = {finite automata, two-way automata, Hennie machine, descriptional complexi
    ty},
  project = {GACR P103/10/0783},
  scopus = {2-s2.0-84898078907},
  update = { 2014-05-26 },
  venue = {Madrid, Spain}
}