A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations. - Elena Barcucci; Antonio Bernini; Luca Ferrari 001; Maddalena Poneti (Order, 2005)

A general exhaustive generation algorithm for Gray structures. - Antonio Bernini; Elisabetta Grazzini; Elisa Pergola; Renzo Pinzani (Acta Informatica, 2007)

Order properties of the Motzkin and Schroder families. - Antonio Bernini; Luca Ferrari 001 (Australas. J Comb., 2007)

Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three. - Antonio Bernini; Luca Ferrari 001; Renzo Pinzani (J. Autom. Lang. Comb., 2009)

The Möbius Function of the Consecutive Pattern Poset. - Antonio Bernini; Luca Ferrari 001; Einar Steingrímsson (Electron. J. Comb., 2011)

Prefix partitioned gray codes for particular cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Cryptogr. Commun., 2014)

The Dyck pattern poset. - Axel Bacher; Antonio Bernini; Luca Ferrari 001; Benjamin Gunby; Renzo Pinzani; Julian West (Discret. Math., 2014)

Gray code orders for q-ary words avoiding a given factor. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Acta Informatica, 2015)

Restricted Binary Strings and Generalized Fibonacci Numbers. - Antonio Bernini (AUTOMATA, 2017)

A Gray code for cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Vincent Vajnovszki (Math. Struct. Comput. Sci., 2017)

Non-overlapping matrices. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Theor. Comput. Sci., 2017)

Cross-bifix-free sets in two dimensions. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Theor. Comput. Sci., 2017)

A static analysis for Brane Calculi providing global occurrence counting information. - Chiara Bodei; Linda Brodo; Roberta Gori; Francesca Levi; Antonio Bernini; Diana Hermith (Theor. Comput. Sci., 2017)

Exhaustive generation of positive lattice paths. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (GASCom, 2018)

A Gray code for a regular language. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (GASCom, 2018)

A 2D non-overlapping code over a q-ary alphabet. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (Cryptogr. Commun., 2018)

Strings from Linear Recurrences: A Gray Code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (WORDS, 2021)

A Strong Non-overlapping Dyck Code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (DLT, 2021)

Enumerative Combinatorics of Intervals in the Dyck Pattern Poset. - Antonio Bernini; Matteo Cervetti; Luca Ferrari 001; Einar Steingrímsson (Order, 2021)

Exhaustive generation of some lattice paths and their prefixes. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (Theor. Comput. Sci., 2021)

On the generating functions of pattern-avoiding Motzkin paths. - Christian Bean; Antonio Bernini; Matteo Cervetti; Luca S. Ferrari (J. Symb. Comput., 2022)

Strings from linear recurrences and permutations: A Gray code. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (Theor. Comput. Sci., 2022)

A Construction for Variable Dimension Strong Non-Overlapping Matrices. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (AFL, 2023)

Dyck Paths Enumerated by the Q-bonacci Numbers. - Elena Barcucci; Antonio Bernini; Stefano Bilotta; Renzo Pinzani (GASCom, 2024)

Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths. - Elena Barcucci; Antonio Bernini; Renzo Pinzani (RAIRO Theor. Informatics Appl., 2024)