Speaker
Kalvis Apsītis
(University of Latvia)
Description
We study n-polyiamonds with the restriction: Their sides lengths are all numbers between 1 and n in this order. Each polyiamond has a unique encoding in a 6-letter alphabet. We study formal grammars to describe interesting families of such polyiamonds.
Acknowledgements
We are grateful to Andrejs Cibulis for introducing this problem to us and making many valuable suggestions.
Keywords
polyiamond area regex CFG grammar
Primary author
Kalvis Apsītis
(University of Latvia)
Co-author
Ms
Marta Rudzāte
(University of Latvia)
