Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
