Enumerating totally clean words

DOI10.1016/0012-365X(87)90202-0zbMATH Open0655.05004MaRDI QIDQ1109033FDOQ1109033

Authors: Doron Zeilberger 

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2051157
• scientific article; zbMATH DE number 749710
• scientific article; zbMATH DE number 3849232
• scientific article; zbMATH DE number 1123887
• Counting Finite Languages by Total Word Length

zbMATH Keywords

recursive procedurefinite alphabet

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Enumeration of words by their number of mistakes

This page was built for publication: Enumerating totally clean words

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