On the average minimal prefix-length of the generalized semi-Dycklanguage

Rainer Kemp

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1996)

  • Volume: 30, Issue: 6, page 545-561
  • ISSN: 0988-3754

How to cite

top

Kemp, Rainer. "On the average minimal prefix-length of the generalized semi-Dycklanguage." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.6 (1996): 545-561. <http://eudml.org/doc/92551>.

@article{Kemp1996,
author = {Kemp, Rainer},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {generalized semi-Dycklanguage},
language = {eng},
number = {6},
pages = {545-561},
publisher = {EDP-Sciences},
title = {On the average minimal prefix-length of the generalized semi-Dycklanguage},
url = {http://eudml.org/doc/92551},
volume = {30},
year = {1996},
}

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
PB - EDP-Sciences
VL - 30
IS - 6
SP - 545
EP - 561
LA - eng
KW - generalized semi-Dycklanguage
UR - http://eudml.org/doc/92551
ER -

References

top
  1. 1. M. ABRAMOWITZ and A. STEGUN, Handbook of Mathematical Functions, Dover, 1970. Zbl0171.38503
  2. 2. E. A. BENDER, Asymptotic Methods in Enumeration, SIAM Review, 1974, 16 (4), pp. 485-515. Zbl0294.05002MR376369
  3. 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. Zbl0227.05007MR281636
  4. 4. L. COMTET, Advanced Combinatorics, D. Reidel, 1974. Zbl0283.05001MR460128
  5. 5. Ph. FLAJOLET and A. M. ODLYZKO, Singularity Analysis of Generating Functions, SIAM J. Discrete Math., 1990, 3 (2), pp. 216-240. Zbl0712.05004MR1039294
  6. 6. M. A. HARRISON, Introduction to Formal Languages, Addison-Wesley, 1978. Zbl0411.68058MR526397
  7. 7. R. KEMP, Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley-Teubner, 1984. Zbl0638.68026MR786659
  8. 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). Zbl0867.68070MR1439128
  9. 9. D. E. KNUTH, The Art of Computer Programming, Vol. 1, 2nd ed., Addison-Wesley, 1973. Zbl0302.68010MR378456
  10. 10. A. ODLYZKO, Asymptotic Enumeration Methods, in: Handbook of Combinatorics, Chapt. 22, Elsevier, 1995. Zbl0845.05005MR1373678

NotesEmbed ?

top

You must be logged in to post comments.