Decidability of Geometricity of Regular Languages

Marie-Pierre Béal (1) , Jean-Marc Champarnaud (2) , Jean-Philippe Dubernard (2) , Hadrien Jeanne (2) , Sylvain Lombardy (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

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.

Domaines: Mathématique discrète [cs.DM]

Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy. Decidability of Geometricity of Regular Languages. 16th International Conference, DLT 2012, 2012, Taipei, Taiwan. pp.62-72, ⟨10.1007/978-3-642-31653-1_7⟩. ⟨hal-00737688⟩