%0 Conference Proceedings
%T Some Computational Limits of Trellis Automata
%+ Equipe AMACC - Laboratoire GREYC - UMR6072
%A Terrier, Véronique
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Milan, Italy
%Y Alberto Dennunzio
%Y Enrico Formenti
%Y Luca Manzoni
%Y Antonio E. Porreca
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10248
%P 176-186
%8 2017-06-07
%D 2017
%R 10.1007/978-3-319-58631-1_14
%Z Computer Science [cs]
%Z Computer Science [cs]/Computational Complexity [cs.CC]Conference papers
%X 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
%G English
%Z TC 1
%Z WG 1.5
%2 https://hal.science/hal-01578301/document
%2 https://hal.science/hal-01578301/file/vergleich.pdf
%L hal-01578301
%U https://hal.science/hal-01578301
%~ CNRS
%~ GREYC
%~ GREYC-AMACC
%~ IFIP-LNCS
%~ IFIP
%~ COMUE-NORMANDIE
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-10248
%~ ENSICAEN
%~ UNICAEN