Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences

DOI10.1016/0097-3165(81)90037-6MaRDI QIDQ1153121zbMATH OpenOpenAlexFDO

Authors John S. Devitt, David M. Jackson

Publication date 1981

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(81)90037-6

zbMATH Keywords

generating functionsfunctional equationregular expressions

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites work

• A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
• Comma-Free Codes
• Maximal and variable word-length comma-free codes
• On the construction of comma-free codes

This page was built for publication: Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences

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