Geometricity of binary regular languages

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:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 5
Cited 4

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

Real-Time Systems
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

Regular geometrical languages and tiling the plane

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
Decidability of geometricity of regular languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our aim is to present an efficient algorithm for checking whether a regular language is geometrical or not, based on specific properties of its minimal automaton. Geometrical languages have interesting theoretical properties and they provide an original model for off-line temporal validation of real-time softwares. As far as implementation is concerned, the regular case is of practical interest, which motivates the design of an efficient geometricity test addressing the family of regular languages. This study generalizes the algorithm designed by the authors for the case of prolongable binary regular languages.