Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Combinatorial Algorithms on Words

BuchKartoniert, Paperback
363 Seiten
Englisch
Springererschienen am26.11.2012Softcover reprint of the original 1st ed. 1985
Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploit the combinatorial properties of the logical/physical input arrangement to achieve efficient computational performances.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextCombinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploit the combinatorial properties of the logical/physical input arrangement to achieve efficient computational performances.
Details
ISBN/GTIN978-3-642-82458-6
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2012
Erscheinungsdatum26.11.2012
AuflageSoftcover reprint of the original 1st ed. 1985
ReiheNATO ASI Subseries F:
Seiten363 Seiten
SpracheEnglisch
Gewicht647 g
IllustrationenVIII, 363 p.
Artikel-Nr.29465014

Inhalt/Kritik

Inhaltsverzeichnis
Open Problems in Stringology.- 1 - String Matching.- Efficient String Matching with Don´t-care Patterns.- Optimal Factor Transducers.- Relating the Average-case Cost of the Brute force and the Knuth-Morris-Pratt String Matching Algorithm.- Algorithms for Factorizing and Testing Subsemigroups.- 2 - Subword Trees.- The Myriad Virtues of Subword Trees.- Efficient and Elegant Subword Tree Construction.- 3 - Data Compression.- Textual Substitution Techniques for Data Compression.- Variations on a Theme by Ziv and Lempel.- Compression of Two-dimensional Images.- Optimal Parsing of Strings.- Novel Compression of Sparse Bit Strings.- 4 - Counting.- The Use and Usefulness of Numeration Systems.- Enumeration of Strings.- Two Counting Problems Solved via String Encodings.- Some Uses of the Mellin integral Transform in the Analysis of Algorithms.- 5 - Periods and Other Regularities.- Periodicities in Strings.- Linear Time Recognition of Square free Strings.- Discovering Repetitions in Strings.- Some Decision Results on Nonrepetitive Words.- 6 - Miscellaneous.- On the Complexity of some Word Problems Which Arise in Testing the Security of Protocols.- Code Properties and Derivatives of DOL Systems.- Words over a Partially Commutative Alphabet.- The Complexity of Two-way Pushdown Automata and Recursive Programs.- On Context Free Grammars and Random Number Generation.mehr