Skip to main content
SpringerLink
Log in

On the average complexity of the membership problem for a generalized Dyck language

  • Technical Contributions
  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Included in the following conference series:

  • 98 Accesses

Abstract

A general concept for analysing the average complexity of the membership problem for any formal language is used in order to examine a generalization of the Dyck language. Our investigation is motivated by the fact that the Dyck language has a distinguished behaviour concerning that parameter. Surprisingly, that behaviour is lost even by small variations without utilising any opposite controls, e.g. adapting probabilities. This observation supports the significance of the Dyck language in computer science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Article  Google Scholar 

  3. D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms, Birkhäuser (1982)

    Google Scholar 

  4. M. A. Harrison, Introduction to Formal Languages, Addison-Wesley (1978)

    Google Scholar 

  5. R. Kemp, Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley-Teubner Series in Computer Science, Wiley (1984)

    Google Scholar 

  6. 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 1 (4) (1996) 259–303

    Google Scholar 

  7. R. Kemp, On the Average Minimal Prefix-Length of the Generalized SemiDyck-language, RAIRO Theoretical Informatics and Applications, to appear

    Google Scholar 

  8. A. Odlyzko, Asymptotic Enumeration Methods, in: Handbook of Combinatorics, Chap. 22, Elsevier (1995)

    Google Scholar 

  9. J. Riordan, Combinatorial Identities, Robert E. Krieger Publishing Company (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Frankfurt Fachbereich Informatik, Johann Wolfgang Goethe-Universität, D-60054, Frankfurt am Main, Germany

    Markus E. Nebel

Authors
  1. Markus E. Nebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nebel, M.E. (1997). On the average complexity of the membership problem for a generalized Dyck language. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036197

Download citation

  • DOI: https://doi.org/10.1007/BFb0036197

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation