<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05996405</id>
  <dt>j</dt>
  <an>05996405</an>
  <augroup>
    <au>Savchuk, Dmytro</au>
    <au>Vorobets, Yaroslav</au>
  </augroup>
  <ti>Automata generating free products of groups of order 2.</ti>
  <so>J. Algebra 336, No. 1, 53-66 (2011).</so>
  <py>2011</py>
  <pu>Elsevier Science (Academic Press), San Diego, CA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>groups generated by automata</ut>
    <ut>free products</ut>
    <ut>dual automata</ut>
    <ut>bireversible automata</ut>
    <ut>groups acting on trees</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.jalgebra.2011.02.049</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We construct a family of automata with $n$ states, $n\geqslant 4$, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.</ab>
    <rv></rv>
  </abgroup>
</item>