Search for Topics All Reviews
	Browse All Reviews > Data (E) > Coding And Information Theory (E.4) > Nonsecret Encoding Schemes (E.4...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-2 of 2 Reviews about "Nonsecret Encoding Schemes (E.4...)": Date Reviewed   Proof of Dejean’s conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters Ollagnier J. Theoretical Computer Science 95(2): 187-205, 1992.  Type: Article Given a k-letter finite alphabet A, a repetition is a pair ( p , e ) of words in A*, where | p | > 0 and... Sep 1 1993   Bounded delay L codes Maurer H., Salomaa A. (ed), Wood D. (ed) Theoretical Computer Science 84(2): 265-279, 1991.  Type: Article The authors continue the study of a simple extension of morphic encoding schemes on strings. A morphism  h : &SGr;* → &Sgr;  is a code if it is injective, and is an L code if the as... Oct 1 1992
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy