Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order

2011 ◽  
pp. 182-194 ◽  
Author(s):  
Stephane Durocher ◽  
Pak Ching Li ◽  
Debajyoti Mondal ◽  
Aaron Williams
Keyword(s):  
Dyck Words

scholarly journals On rational Dyck paths and the enumeration of factor-free Dyck words

2018 ◽  
Vol 244 ◽  
pp. 36-43 ◽  
Author(s):  
Daniel Birmajer ◽  
Juan B. Gil ◽  
Michael D. Weiner
Keyword(s):  
Dyck Paths ◽  
Dyck Words

The Phagocyte Lattice of Dyck Words

Order ◽  
2006 ◽  
Vol 23 (2-3) ◽  
pp. 97-107 ◽  
Author(s):  
J. L. Baril ◽  
J. M. Pallo
Keyword(s):  
Dyck Words

scholarly journals Refunctionalization at Work

2008 ◽  
Vol 15 (4) ◽  
Author(s):  
Olivier Danvy ◽  
Kevin Millikin
Keyword(s):  
Programming Languages ◽  
Left Inverse ◽  
Shunting Yard ◽  
Dyck Words

We present the left inverse of Reynolds's defunctionalization and we show its relevance to programming and to programming languages. We propose two methods to transform a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm.

A novel approach to steganography based on the properties of Catalan numbers and Dyck words

2019 ◽  
Vol 100 ◽  
pp. 186-197 ◽  
Author(s):  
Muzafer Saračević ◽  
Saša Adamović ◽  
Vladislav Miškovic ◽  
Nemanja Maček ◽  
Marko Šarac
Keyword(s):  
Catalan Numbers ◽  
Novel Approach ◽  
Dyck Words

scholarly journals Refunctionalization at Work

2007 ◽  
Vol 14 (7) ◽  
Author(s):  
Olivier Danvy ◽  
Kevin Millikin
Keyword(s):  
Programming Languages ◽  
Left Inverse ◽  
Shunting Yard ◽  
Dyck Words

We present the left inverse of Reynolds's defunctionalization and we show its relevance to programming and to programming languages. We present two methods to put a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm.

scholarly journals Some permutations on Dyck words

2016 ◽  
Vol 635 ◽  
pp. 51-63 ◽  
Author(s):  
Marilena Barnabei ◽  
Flavio Bonetti ◽  
Niccolò Castronuovo ◽  
Robert Cori
Keyword(s):  
Dyck Words

scholarly journals On an algebraicity theorem of Kontsevich

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Christophe Reutenauer ◽  
Marco Robado
Keyword(s):  
Combinatorial Proof ◽  
Noncommutative Version ◽  
Nous Montrons ◽  
International Audience ◽  
Planar Maps ◽  
Full Proof ◽  
Dyck Words

International audience We give in a particular case a combinatorial proof of a recent algebraicity result of Kontsevich; the proof uses generalized one-sided and two-sided Dyck words, or equivalently, excursions and bridges. We indicate a noncommutative version of these notions, which could lead to a full proof. We show also a relation with pointed planar maps. Nous donnons, dans un cas particulier, une preuve combinatoire d'un rèsultat rècent d'algèbricitè de Kontsevich; la preuve utilise des mots de Dyck gènèralisès d'un cotè et deux cotès ou de façon èquivalente, excursions et ponts. Nous indiquons une version non-commutative de ces notions, qui pourrait conduire à une preuve complète. Nous montrons aussi une relation avec des cartes planaires pointèes.

Sign in / Sign up

Export Citation Format

Share Document