Some Computational Limits of Trellis Automata
Résumé
We investigate some computational limits of trellis automata. Reusing a counting argument introduced in [4], we show that: {x_1,..., x_n,y_1,...,y_n : x_iy_i ∈ {ab, ba, bb} for i = 1,. .. , n} is not a trellis language.[4]Ana¨ll Grandjean, Gaétan Richard, and Véronique Terrier. Linear functional classes over cellular automata. In Enrico Formenti, editor, Proceedings AUTOMATA & JAC 2012, pages 177–193, 2012
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...