On the Burnside problem for semigroups of matrices in the (max, +) algebra. Semigroup Forum, pp.271-292, 1996. ,
Modeling and analysis of timed Petri nets using heaps of pieces, IEEE Transactions on Automatic Control, vol.44, issue.4, pp.683-698, 1998. ,
DOI : 10.1109/9.754807
URL : https://hal.archives-ouvertes.fr/hal-00165813
Approximate reasoning in semi-structured databases, KRDB2001 Proceedings of CEUR Workshop Proceedings, 2001. ,
A decision procedure for the order of regular events, Theoretical Computer Science, vol.8, issue.1, pp.69-72, 1979. ,
DOI : 10.1016/0304-3975(79)90057-4
Limitedness theorem on finite automata with distance functions, Journal of Computer and System Sciences, vol.24, issue.2, pp.233-244, 1982. ,
DOI : 10.1016/0022-0000(82)90051-4
Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1988. ,
DOI : 10.1016/0890-5401(88)90033-8
Improved limitedness theorems on finite automata with distance functions, Theoretical Computer Science, vol.72, issue.1, pp.27-38, 1990. ,
DOI : 10.1016/0304-3975(90)90044-I
DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA, International Journal of Algebra and Computation, vol.12, issue.03, pp.445-461, 2002. ,
DOI : 10.1142/S0218196702000845
The similarity and equivalence problem for finitely ambiguous automata over the tropical semiring, 2006. ,
Communication Complexity Method for Measuring Nondeterminism in Finite Automata, Information and Computation, vol.172, issue.2, pp.202-217, 2002. ,
DOI : 10.1006/inco.2001.3069
On sparseness, ambiguity and other decision problems for acceptors and transducers, STACS'86, pp.171-179, 1986. ,
Distance desert automata and the star height problem. R.A.I.R.O. -Informatique Théorique et Applications, special issue of selected best papers from FoSSaCS, pp.455-509, 2004. ,
Distance desert automata and star height substitutions. Habilitationsschrift, 2006. ,
DOI : 10.1051/ita:2005027
A Burnside approach to the termination of Mohri's algorithm for polynomially ambiguous min-plus-automata. R.A.I.R.O. -ITA, special issue on " JM'06, pp.553-581, 2008. ,
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Theoretical Computer Science, vol.327, issue.3, pp.349-373, 2004. ,
DOI : 10.1016/j.tcs.2004.02.049
URL : https://hal.archives-ouvertes.fr/hal-00174171
THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE, International Journal of Algebra and Computation, vol.04, issue.03, pp.405-425, 1994. ,
DOI : 10.1142/S0218196794000063
URL : https://hal.archives-ouvertes.fr/hal-00017729
Some consequences of a Fatou property of the tropical semiring, Journal of Pure and Applied Algebra, vol.93, issue.3, pp.231-249, 1994. ,
DOI : 10.1016/0022-4049(94)90090-6
URL : https://hal.archives-ouvertes.fr/hal-00017321
The topological approach to the limitedness problem on distance automata, pp.88-111, 1998. ,
DOI : 10.1017/CBO9780511662508.007
Sequential? Theoretical Computer Science, pp.224-244, 2006. ,
New Results on the Star Problem in Trace Monoids, Information and Computation, vol.119, issue.2, pp.240-251, 1995. ,
DOI : 10.1006/inco.1995.1088
Finite-state transducers in language and speech processing, Computational Linguistics, vol.23, pp.269-311, 1997. ,
On the degree of ambiguity of finite automata, Th. C. Sc, vol.88, pp.325-349, 1991. ,
Recognizable sets with multiplicities in the tropical semiring, MFCS'88 Proceedings, pp.107-120, 1988. ,
DOI : 10.1007/BFb0017135
On semigroups of matrices over the tropical semiring, RAIRO - Theoretical Informatics and Applications, vol.28, issue.3-4, pp.277-294, 1994. ,
DOI : 10.1051/ita/1994283-402771