Titlebook: Cellular Automata and Discrete Complex Systems; 23rd IFIP WG 1.5 Int Alberto Dennunzio,Enrico Formenti,Antonio E. Porre Conference proceedi

addict

accrete

CYT

https://doi.org/10.1007/978-3-322-86004-0We investigate some computational limits of trellis automata. Reusing a counting argument introduced in?[.], we show that: .is not a trellis language.

固執(zhí)點(diǎn)好

Some Computational Limits of Trellis AutomataWe investigate some computational limits of trellis automata. Reusing a counting argument introduced in?[.], we show that: .is not a trellis language.

CANDY

偽造

DEMN

Binge-Drinking

978-3-319-58630-4IFIP International Federation for Information Processing 2017

無(wú)意

Fatten

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Propertiespictures in .. It is in general undecidable whether a set of pictures is a code, even in the finite case. Recently, finite strong prefix codes were introduced in [.] as a family of decidable picture codes. In this paper we study infinite strong prefix codes and give a characterization for the maxima