Decidability of Geometricity of Regular LanguagesReport as inadecuate

Decidability of Geometricity of Regular Languages - Download this document for free, or read online. Document in PDF available to download.

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

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.

Author: Marie-Pierre Béal - Jean-Marc Champarnaud - Jean-Philippe Dubernard - Hadrien Jeanne - Sylvain Lombardy -



Related documents