On the average minimal prefix-length of the generalized semi-Dycklanguage
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 6, pp. 545-561. 
@article{ITA_1996__30_6_545_0,
     author = {Kemp, Rainer},
     title = {On the average minimal prefix-length of the generalized {semi-Dycklanguage}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {545--561},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {6},
     year = {1996},
     mrnumber = {1454829},
     zbl = {0877.68077},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1996__30_6_545_0/}
}
TY  - JOUR
AU  - Kemp, Rainer
TI  - On the average minimal prefix-length of the generalized semi-Dycklanguage
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1996
SP  - 545
EP  - 561
VL  - 30
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1996__30_6_545_0/
LA  - en
ID  - ITA_1996__30_6_545_0
ER  - 
%0 Journal Article
%A Kemp, Rainer
%T On the average minimal prefix-length of the generalized semi-Dycklanguage
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1996
%P 545-561
%V 30
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1996__30_6_545_0/
%G en
%F ITA_1996__30_6_545_0
Kemp, Rainer. On the average minimal prefix-length of the generalized semi-Dycklanguage. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 6, pp. 545-561. http://archive.numdam.org/item/ITA_1996__30_6_545_0/

1. M. Abramowitz and A. Stegun, Handbook of Mathematical Functions, Dover, 1970.

2. E. A. Bender, Asymptotic Methods in Enumeration, SIAM Review, 1974, 16 (4), pp. 485-515. | MR | Zbl

3. L. Carlitz, D. P. Roselle and R. A. Scoville, Some Remarks on Ballot-Type Sequences of Positive Integers, J. Comb. Theory (A), 1971, 11, pp. 258-271. | MR | Zbl

4. L. Comtet, Advanced Combinatorics, D. Reidel, 1974. | MR | Zbl

5. Ph. Flajolet and A. M. Odlyzko, Singularity Analysis of Generating Functions, SIAM J. Discrete Math., 1990, 3 (2), pp. 216-240. | MR | Zbl

6. M. A. Harrison, Introduction to Formal Languages, Addison-Wesley, 1978. | MR | Zbl

7. R. Kemp, Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley-Teubner, 1984. | MR | Zbl

8. R. Kemp, On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem, Journal of Automata, Languages and Combinatorics, 1996 (to appear). | MR | Zbl

9. D. E. Knuth, The Art of Computer Programming, Vol. 1, 2nd ed., Addison-Wesley, 1973. | MR

10. A. Odlyzko, Asymptotic Enumeration Methods, in: Handbook of Combinatorics, Chapt. 22, Elsevier, 1995. | MR | Zbl