Tiling problems, automata, and tiling graphs

DOI10.1016/j.tcs.2008.07.019zbMath1152.68026OpenAlexW2091833703MaRDI QIDQ955017

Katherine P. Benedetto, Nicholas A. Loehr

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.019

zbMATH Keywords

dominotilingbijectiongrammardeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (1)

Monomer-dimer tatami tilings of square regions

Cites Work

• Unnamed Item
• Strip tiling and regular grammars
• A strip-like tiling algorithm
• Central and local limit theorems applied to asymptotic enumeration
• The statistics of dimers on a lattice
• Dimer problem in statistical mechanics-an exact result
• On context-free languages and push-down automata
• Enumeration of perfect matchings in graphs with reflective symmetry

This page was built for publication: Tiling problems, automata, and tiling graphs