Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
