@inproceedings{Prusa-LATA-2014,
  IS = { zkontrolovano 29 May 2014 },
  UPDATE  = { 2014-05-26 },
  author    = {Daniel Pr{\accent23 u}{\v s}a},
  title     = {Weight-Reducing Hennie Machines and Their Descriptional Complexity},
  booktitle = {LATA 2014: Proceedings of the 8th International Conference on Language an
d Automata Theory and Applications},
  editor    = {Dediu, Adrian Horia  and Mart{\'\i}n-Vide, Carlos  and Sierra-Rodr\'{\i}guez, 
Jos{\'e} Luis  and Truthe, Bianca},
  publisher = {Springer},
  address   = {Berlin, Germany},
  series    = {Lecture Notes in Computer Science},
  volume    = {8370},
  pages     = {553-564},
  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.},
  keywords  = {finite automata, two-way automata, Hennie machine, descriptional complexi
ty},
  venue     = {Madrid, Spain},
  year      = {2014},
  month     = {March},
  day       = {10-14},
  isbn      = {978-3-319-04920-5},
  book_pages = {614},
  project   = {GACR P103/10/0783},
  affiliation = {13133},
  scopus    = {2-s2.0-84898078907},
}