An up-to-date view of several topics in theoretical computer science. The contributions to this volume include: methods for finding the smallest possible Markov Chain that could produce a given sequence of numbers; string matching algorithms; and techniques for designing error-correcting codes.
Read More
An up-to-date view of several topics in theoretical computer science. The contributions to this volume include: methods for finding the smallest possible Markov Chain that could produce a given sequence of numbers; string matching algorithms; and techniques for designing error-correcting codes.
Read Less
Add this copy of Sequences II: Methods in Communication, Security, and to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Springer.
