<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06105109</id>
  <dt>j</dt>
  <an>06105109</an>
  <augroup>
    <au>Anashin, V.</au>
  </augroup>
  <ti>Automata finiteness criterion in terms of van der Put series of automata functions.</ti>
  <so>$p$-Adic Numbers Ultrametric Anal. Appl. 4, No. 2, 151-160 (2012).</so>
  <py>2012</py>
  <pu>MAIK Nauka/Interperiodica, Moscow; Springer, Heidelberg</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>automaton</ut>
    <ut>finiteness conditions</ut>
    <ut>$p$-adic numbers</ut>
    <ut>van der Put series</ut>
    <ut>automata sequences</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1134/S2070046612020070</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In the paper we develop the p-adic theory of discrete automata. Every automaton $\frak{A}$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic integers to $p$-adic integers, the automaton function $f_{\mathfrak{A}}$. The $p$-adic theory (in particular, the $p$-adic ergodic theory) turned out to be very efficient in a study of properties of automata expressed via properties of automata functions. In the paper we prove a criterion for finiteness of the number of states of automaton in terms of van der Put series of the automaton function. The criterion displays connections between $p$-adic analysis and the theory of automata sequences.</ab>
    <rv></rv>
  </abgroup>
</item>