Geometrical regular languages and linear Diophantine equations: The strongly connected case - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2012

Geometrical regular languages and linear Diophantine equations: The strongly connected case

Résumé

Given an arbitrarily large alphabet Σ, we consider the family of regular languages over Σ for which the deterministic minimal automaton has a strongly connected state diagram. We present a new method for checking whether such a language is semi-geometrical or not and whether it is geometrical or not. This method makes use of the enumeration of the simple cycles of the state diagram. It is based on the construction of systems of linear Diophantine equations, where the coefficients are deduced from the set of simple cycles

Dates et versions

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

Identifiants

Citer

Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne. Geometrical regular languages and linear Diophantine equations: The strongly connected case. Theoretical Computer Science, 2012, 449, pp.54-63. ⟨10.1016/j.tcs.2012.04.012⟩. ⟨hal-00906811⟩
195 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More