Decidability of geometricity of regular languages

Authors:
Marie-Pierre Béal;Jean-Marc Champarnaud;Jean-Philippe Dubernard;Hadrien Jeanne;Sylvain Lombardy
Affiliations:
Laboratoire d'informatique Gaspard-Monge CNRS UMR 8049, Université Paris-Est, Marne-la-Vallée, France;LITIS, Université de Rouen, Saint-Étienne-du-Rouvray Cedex, France;LITIS, Université de Rouen, Saint-Étienne-du-Rouvray Cedex, France;LITIS, Université de Rouen, Saint-Étienne-du-Rouvray Cedex, France;Laboratoire d'informatique Gaspard-Monge CNRS UMR 8049, Université Paris-Est, Marne-la-Vallée, France
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 7
Cited 0

On the complexity of some extended word problems defined by cancellation rules

Information Processing Letters
Modern computer algebra

Modern computer algebra
The Complexity of Semilinear Sets

Proceedings of the 7th Colloquium on Automata, Languages and Programming
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Theoretical Computer Science
Elements of Automata Theory

Elements of Automata Theory
Geometrical regular languages and linear diophantine equations

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Geometricity of binary regular languages

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geometrical languages generalize languages introduced to model temporal validation of real-time softwares. We prove that it is decidable whether a regular language is geometrical. This result was previously known for binary languages.