A strong non-overlapping Dyck code

DOI10.1007/978-3-030-81508-0_4MaRDI QIDQ832919zbMATH OpenOpenAlexFDO

Authors Elena Barcucci, Antonio Bernini, R. Pinzani

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81508-0_4

zbMATH Keywords

cross bifix-free codesDyck pathsvariable length non-overlapping codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A 2D non-overlapping code over a q-ary alphabet
• A note on bifix-free sequences (Corresp.)
• Computationally efficient bounds for the Catalan numbers
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3423953 (Why is no real title available?)
• Variable-Length Non-Overlapping Codes

Cited in

(5)

• Non-Overlapping Codes
• Restricting Dyck paths and 312-avoiding permutations
• A Construction for Variable Dimension Strong Non-Overlapping Matrices
• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• Counting overlapping pairs of words

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A strong non-overlapping Dyck code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832919)