On codes with finite interpreting delay : a defect theorem
Yannick Guesnet (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On infinitary finite length codes”
On codes with finite interpreting delay : a defect theorem
Caractérisation results about codes
J. Honkala, A. Salomaa (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a class of infinitary codes
Nguyen Huong Lâm, Do Long Van (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Finitary codes for biinfinite words
J. Devolder, E. Timmerman (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidability of code properties
Henning Fernau, Klaus Reinhardt, Ludwig Staiger (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
We explore the borderline between decidability and undecidability of the following question: “Let be a class of codes. Given a machine of type , is it decidable whether the language lies in 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.
On -submonoids and -codes
M. Madonia, S. Salemi, T. Sportelli (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: