Geometrical Regular Languages and Linear Diophantine Equations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2011

Geometrical Regular Languages and Linear Diophantine Equations

Résumé

We present a new method for checking whether a regular language over an arbitrarily large alphabet is semi-geometrical or whether it is geometrical. This method makes use first of the partitioning of the state diagram of the minimal automaton of the language into strongly connected components and secondly of the enumeration of the simple cycles in each component. It is based on the construction of systems of linear Diophantine equations the coefficients of which are deduced from the the set of simple cycles. This paper addresses the case of a strongly connected graph.
Fichier non déposé

Dates et versions

hal-00906785 , version 1 (20-11-2013)

Identifiants

  • HAL Id : hal-00906785 , version 1

Citer

Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne. Geometrical Regular Languages and Linear Diophantine Equations. DCFS 2011, Jul 2011, Giessen/Limburg, Germany. pp.107-120. ⟨hal-00906785⟩
107 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More