Regular approximations to shuffle products of context-free languages, and convergence of their generating functions

Robert S. Maier, René Schott

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We approximate certain languages, obtained as shuffle products of Dyck languages, by regular languages. These regular approximants are obtained by restricting the automaton accepting the original language to a finite maximum amount of storage, N. We study the dominant singularities of the multivariate generating functions of the approximants. By using formal asymptotic methods drawn from applied probability to work out the N → ∞ asymptotics of these singularities, we quantify the rate at which the approximants approach the original languages.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - 9th International Conference, FCT 1993, Proceedings
EditorsZoltan Esik
PublisherSpringer-Verlag
Pages352-362
Number of pages11
ISBN (Print)9783540571636
DOIs
StatePublished - 1993
Event9th International Conference on Fundamentals of Computation Theory, FCT 1993 - Szeged, Hungary
Duration: Aug 23 1993Aug 27 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume710 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Conference on Fundamentals of Computation Theory, FCT 1993
CountryHungary
CitySzeged
Period8/23/938/27/93

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Regular approximations to shuffle products of context-free languages, and convergence of their generating functions'. Together they form a unique fingerprint.

  • Cite this

    Maier, R. S., & Schott, R. (1993). Regular approximations to shuffle products of context-free languages, and convergence of their generating functions. In Z. Esik (Ed.), Fundamentals of Computation Theory - 9th International Conference, FCT 1993, Proceedings (pp. 352-362). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 710 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-57163-9_30