Estimating the Size of Context-Free Tiling Languages

DOI10.4153/CJM-1987-066-4MaRDI QIDQ3766879zbMATH OpenFDO

Authors Kenneth W. Holladay

Publication date 1987

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1987-066-4

zbMATH Keywords

animalsboardpilesbounds on the size of a context-free array languagepathsperiodic tiling

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Some remarks on tiling recognizable languages
• On lengths of words in context-free languages
• scientific article; zbMATH DE number 1747448
• On the density of regular and context-free languages
• On the Density of Regular and Context-Free Languages
• Context-free complexity of finite languages
• scientific article; zbMATH DE number 4033108
• Widths of regular and context-free languages
• The complexity of computing the number of strings of given length in context-free languages
• On the density of context-free and counter languages

Cited in

(1)

• scientific article; zbMATH DE number 176932 (Why is no real title available?)

This page was built for publication: Estimating the Size of Context-Free Tiling Languages

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