<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06073675</id>
  <dt>a</dt>
  <an>06073675</an>
  <augroup>
    <au>Egri-Nagy, Attila</au>
    <au>Nehaniv, Chrystopher L.</au>
  </augroup>
  <ti>On constructing and visualizing cascaded automata.</ti>
  <so>Egri-Nagy, Attila (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), Eger, Hungary, January 27--30, 2010. 2 Volumes. Eger: BVB Nyomda \'es Kiad\'o Kft. (ISBN 978-963-9894-72-3/pbk). 229-237 (2012).</so>
  <py>2012</py>
  <pu>Eger: BVB Nyomda \'es Kiad\'o Kft.</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: Cascaded compositions are important constructions for understanding the structure of a given automaton, though they are quite complicated objects (especially their algebraic counterpart, the wreath product). Therefore, despite several attempts to bring them in the mainstream, cascaded structures still play an underappreciated role in computer science. Here we try to help this situation by giving easy definitions, visualization techniques, efficient constructions of cascaded structures based on dependency functions, i.e. hierarchically built automata. These mathematical tools are supported by computational implementations.</ab>
    <rv></rv>
  </abgroup>
</item>