Abstract
AbstractDigital trees, such as tries, and Patricia tries are data structures routinely used in a variety of computer and communication applications including dynamic hashing, partial match retrieval, searching and sorting, conflict resolution algorithms for communication broadcast, data compression, and so forth. Here, we consider tries and Patricia tries built from n words emitted by a probabilistic dynamical source. Such sources encompass classical and many models such as memoryless sources and finite Markov chains. The probabilistic behavior of its main parameters, namely, the size and the path length, appears to be determined by some intrinsic characteristics of the source, such as Shannon entropy and entropy‐like constants, that depend on the spectral properties of specific transfer operators of Ruelle type. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19: 289–315, 2001
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
