Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Diamond:1995:FCS, author = "P. Diamond and P. Kloeden and V. Kozyakin and A. Pokrovskii", title = "On the fragmentary complexity of symbolic sequences", journal = j-THEOR-COMP-SCI, volume = "148", number = "1", pages = "1--17", day = "21", month = aug, year = "1995", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:19:18 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=148&issue=1&aid=1895", acknowledgement = ack-nhfb, classification = "C4240C (Computational complexity)", corpsource = "Dept. of Math., Queensland Univ., Brisbane, Qld., Australia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; fragmentary complexity; multirate systems of coprocessors; shift mappings; symbolic sequence; symbolic sequences; torus", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", }