Regular Geometrical Languages and Tiling the Plane

DOI10.1007/978-3-642-18098-9_8zbMath1297.68114OpenAlexW1551183554MaRDI QIDQ3073623

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

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

Related Items (2)

Geometrical regular languages and linear Diophantine equations: the strongly connected case ⋮ Geometrical Regular Languages and Linear Diophantine Equations

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Linear Automaton Transformations
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• Geometricity of Binary Regular Languages
• Discrete Geometry for Computer Imagery
• On Context-Free Languages

This page was built for publication: Regular Geometrical Languages and Tiling the Plane