| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 3, July-September 2007
|
|
|---|---|---|
| Page(s) | 243 - 259 | |
| DOI | https://doi.org/10.1051/ita:2007019 | |
| Published online | 25 September 2007 | |
Decidability of code properties
1
Fachbereich IV, Abteilung Informatik, Universität Trier, 54286 Trier, Germany; fernau@uni-trier.de
2
Wilhelm-Schickard-Institut für Informatik, Universität Tübingen,
Sand 13, 72076 Tübingen, Germany; reinhard@informatik.uni-tuebingen.de
3
Institut für Informatik,
Martin-Luther-Universität Halle-Wittenberg, von-Seckendorff-Platz 1, 06099 Halle, Germany; staiger@informatik.uni-halle.de
Received:
17
March
2003
Accepted:
10
May
2005
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 
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.
Mathematics Subject Classification: 68Q45 / 03D05 / 94A45 / 94B99
Key words: Partially blind counter machines / prefix code / infix code / bifix code / deciphering delay / decidability
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.