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

DOI10.1016/0097-3165(81)90037-6zbMath0461.94007OpenAlexW2005793653MaRDI QIDQ1153121

David M. Jackson, John S. Devitt

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

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

Cites Work

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

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