Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Gray visiting Motzkins

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We present the first Gray code for Motzkin words and their generalizations: k colored Motzkin words and Schröder words. The construction of these Gray codes is based on the observation that a k colored Motzkin word is the shuffle of a Dyck word by a k-ary variation on a trajectory which is a combination. In the final part of the paper we give some algorithmic considerations and other possible applications of the techniques introduced here.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. LE2I – CNRS FRE 2309, Université de Bourgogne, B.P. 47 870, 21 078 Dijon-Cedex, France (e-mail: vvajnov@u-bourgogne.fr) , , , , , , FR

    Vincent Vajnovszki

Authors
  1. Vincent Vajnovszki
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 7 May 2001 / 21 June 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vajnovszki, V. Gray visiting Motzkins. Acta Informatica 38, 793–811 (2002). https://doi.org/10.1007/s00236-002-0097-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-002-0097-0

Keywords

Search

Navigation