The relevant prefixes of coloured Motzkin walks: an average case analysis
type: Item
instance of: scholarly article
title: The relevant prefixes of coloured Motzkin walks: an average case analysis
zbMATH Open document ID: 1189.68181
published in: Theoretical Computer Science
publication date: 2009-12-01T00:00:00Z
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5641357
zbMATH Keywords: average case analysis
zbMATH Keywords: coloured Motzkin walks
zbMATH Keywords: probability generating functions
zbMATH Keywords: random generation
zbMATH Keywords: ranking
Wikidata QID: Q60692282
author: Donatella Merlini
author: Renzo Sprugnoli
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.021
OpenAlex ID: W2048233076
cites work: Uniform generation of a Motzkin word
cites work: Random generation of trees and other combinatorial objects
cites work: Q4013349
cites work: The random generation of underdiagonal walks
cites work: Non-uniform random generation of generalized Motzkin paths
cites work: A bijection between ordered trees and 2-Motzkin paths and its many consequences
cites work: Motzkin numbers
cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures
cites work: Boltzmann Sampling of Unlabelled Structures
cites work: A calculus for the random generation of labelled combinatorial structures
cites work: Generating words lexicographically: An average-case analysis
cites work: Q4234989
cites work: Q4209250
cites work: Ranking and unranking of a generalized Dyck language and the application to the generation of random trees
cites work: A generic approach for the unranking of labeled combinatorial classes
cites work: Efficient iteration in admissible combinatorial classes
cites work: On Some Alternative Characterizations of Riordan Arrays
cites work: Underdiagonal lattice paths with unrestricted steps
cites work: Q4954452
cites work: Generating trees and proper Riordan arrays
cites work: Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
cites work: Q3932310
cites work: Q3024001
cites work: A fast algorithm to generate necklaces with fixed content
cites work: Q4855565
cites work: The Riordan group
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Riordan arrays and combinatorial sums
cites work: Q4236280
DOI: 10.1016/J.TCS.2009.09.021
Recommended article: Q4954452
Recommended article: A construction for enumerating k-coloured Motzkin paths
Recommended article: Monotonic walks on a necklace and a coloured dynamic vector
Recommended article: Combinatorics of nondeterministic walks of the Dyck and Motzkin type
Recommended article: Q3024001
Recommended article: Random walks on colored graphs
Recommended article: Q4863421
Recommended article: Colored Motzkin Paths of Higher Order
Recommended article: Some matrix identities on colored Motzkin paths
description: scientific article; zbMATH DE number 5641357