Page 1 Next

Displaying 1 – 20 of 38

Showing per page

Decidability of code properties

Henning Fernau, Klaus Reinhardt, Ludwig Staiger (2007)

RAIRO - Theoretical Informatics and Applications

We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machine 𝔐 of type X, is it decidable whether the language L ( 𝔐 ) lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.

Currently displaying 1 – 20 of 38

Page 1 Next