Regular geometrical languages and tiling the plane

Authors:
Jean-Marc Champarnaud;Jean-Philippe Dubernard;Hadrien Jeanne
Affiliations:
LITIS, University of Rouen, France;LITIS, University of Rouen, France;LITIS, University of Rouen, France
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 7
Cited 2

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Polyominoes defined by two vectors

Theoretical Computer Science
On Context-Free Languages

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Theoretical Computer Science
Discrete geometry applied in hard real-time systems validation

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Geometricity of binary regular languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Geometrical regular languages and linear diophantine equations

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Geometrical regular languages and linear Diophantine equations: The strongly connected case

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that if a binary language L is regular, prolongable and geometrical, then it can generate, on certain assumptions, a p1 type tiling of a part of N2. We also show that the sequence of states that appear along a horizontal line in such a tiling only depends on the shape of the tiling sub-figure and is somehow periodic.