Geometrical Regular Languages and Linear Diophantine Equations
- Cite this paper as:
- Champarnaud JM., Dubernard JP., Guingne F., Jeanne H. (2011) Geometrical Regular Languages and Linear Diophantine Equations. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.