The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The visibility parameter for words and permutations”

The box parameter for words and permutations

Helmut Prodinger (2014)

Open Mathematics

Similarity:

The box parameter for words counts how often two letters w j and w k define a “box” such that all the letters w j+1; ..., w k−1 fall into that box. It is related to the visibility parameter and other parameters on words. Three models are considered: Words over a finite alphabet, permutations, and words with letters following a geometric distribution. A typical result is: The average box parameter for words over an M letter alphabet is asymptotically given by 2n − 2n H M/M, for fixed...

Regular Expression Quantifiers - m to n Occurrences

Michał Trybulec (2007)

Formalized Mathematics

Similarity:

This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0...