Pattern Matching Machine implementation of a fast test for unique decipherability
- 30 March 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 18 (3) , 155-158
- https://doi.org/10.1016/0020-0190(84)90020-6
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A fast test for unique decipherability based on suffix trees (Corresp.)IEEE Transactions on Information Theory, 1982
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975