Regular geometrical languages and tiling the plane

DOI10.1007/978-3-642-18098-9_8MaRDI QIDQ3073623zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Dubernard, Hadrien Jeanne, Jean-Marc Champarnaud

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18098-9_8

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Formal languages and automata (68Q45)

Recommendations

• Some remarks on tiling recognizable languages
• Strip tiling and regular grammars
• Recognizable vs. Regular Picture Languages
• Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
• Tiling problems, automata, and tiling graphs

Cites work

• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• Discrete Geometry for Computer Imagery
• Geometricity of binary regular languages
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• Linear Automaton Transformations
• On Context-Free Languages
• On translating one polyomino to tile the plane
• Polyominoes defined by two vectors
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Cited in

(5)

• Strip tiling and regular grammars
• Line Languages
• Geometrical regular languages and linear Diophantine equations: the strongly connected case
• Geometrical regular languages and linear Diophantine equations
• Tiling problems, automata, and tiling graphs

This page was built for publication: Regular geometrical languages and tiling the plane

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