EUVIMEDEUVIMED entdecken
Crossref

Random Generation of k-coloured Motzkin Paths

Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani

Electronic Proceedings in Theoretical Computer Science · 07.06.2026 · 445 · 10-15

DOI: 10.4204/eptcs.445.2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 07.06.2026. Verfasst von Elena Barcucci und 3 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study k-coloured Motzkin paths, namely Motzkin paths in which horizontal steps can be coloured in k different ways, and investigate their connection with the number of prefixes ending at odd height from both an analytical and a combinatorial point of view. Moreover, the combinatorial approach provides a random generation algorithm for k-coloured Motzkin paths in linear-time.

Zitieren

APA

Barcucci, E., Bernini, A., Bilotta, S., & Pinzani, R. (2026). Random Generation of k-coloured Motzkin Paths. Electronic Proceedings in Theoretical Computer Science, 445, 10-15. https://doi.org/10.4204/eptcs.445.2

Vancouver

Barcucci E, Bernini A, Bilotta S, Pinzani R. Random Generation of k-coloured Motzkin Paths. Electronic Proceedings in Theoretical Computer Science. 2026;445:10-15. doi:10.4204/eptcs.445.2

BibTeX
@article{Barcucci2026,
  author = {Barcucci, Elena and Bernini, Antonio and Bilotta, Stefano and Pinzani, Renzo},
  title = {Random Generation of k-coloured Motzkin Paths},
  journal = {Electronic Proceedings in Theoretical Computer Science},
  year = {2026},
  volume = {445},
  pages = {10--15},
  doi = {10.4204/eptcs.445.2}
}
Kostenlos starten →