Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A strip-like tiling algorithm

From MaRDI portal
Publication:1603720
Jump to:navigation, search

DOI10.1016/S0304-3975(01)00074-3zbMath1014.68078OpenAlexW2088072426MaRDI QIDQ1603720

R. Smith

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00074-3

zbMATH Keywords

generating functionsregular grammarsSchützenberger methodologystrip tilings


Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)


Related Items

Combinatorial analysis of tetris-like games, Tiling problems, automata, and tiling graphs


Uses Software

  • Leonardo


Cites Work

  • Unnamed Item
  • Paving the chessboard
  • Algebraic languages and polyominoes enumeration
  • Packing rectangles with congruent polyominoes
  • Tiling rectangles with polyominoes
  • Strip tiling and regular grammars
  • The statistics of dimers on a lattice
  • Asymptotic Methods in Enumeration
  • Dimer problem in statistical mechanics-an exact result
  • On context-free languages and push-down automata
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1603720&oldid=13903840"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki