sans répétition" 59 A, p.61 ,
EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA, International Journal of Foundations of Computer Science, vol.19, issue.04, pp.751-765, 2008. ,
DOI : 10.1142/S0129054108005930
Two-way automata with multiplicity, ICALP'90, pp.88-102, 1990. ,
DOI : 10.1007/BFb0032024
Enumeration and random generation of accessible automata, Theoretical Computer Science, vol.381, issue.1-3, pp.86-104, 2007. ,
DOI : 10.1016/j.tcs.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00459712
Squaring transducers: an efficient procedure for deciding functionality and sequentiality, Theoretical Computer Science, vol.292, issue.1, pp.45-63, 2003. ,
DOI : 10.1016/S0304-3975(01)00214-6
Signal Flow Graph Techniques for Sequential Circuit State Diagrams, IEEE Transactions on Electronic Computers, vol.12, issue.2, pp.1267-76, 1963. ,
DOI : 10.1109/PGEC.1963.263416
Derivatives of regular expressions, J. ACM, vol.11, issue.4, pp.481-494, 1964. ,
Random Generation of Deterministic Acyclic Automata Using Markov Chains, CIAA, pp.65-75, 2011. ,
DOI : 10.1016/0304-3975(92)90142-3
URL : https://hal.archives-ouvertes.fr/hal-00841862
Sampling different kinds of acyclic automata using Markov chains, Theoretical Computer Science, vol.450, pp.31-42, 2012. ,
DOI : 10.1016/j.tcs.2012.04.025
URL : https://hal.archives-ouvertes.fr/hal-00841870
Factorizations and universal automaton of omega languages, Developments in Language Theory, pp.338-349, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01120568
On determinism and unambiguity of weighted two-way automata, AFL, pp.188-200, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01326283
Tropical Two-Way Automata, Theor. Comput . Sci, vol.8705, pp.195-206, 2014. ,
DOI : 10.1007/978-3-662-44602-7_16
URL : https://hal.archives-ouvertes.fr/hal-01069637
Small Extended Expressions for Acyclic Automata, Lecture Notes in Computer Science Theor. Comput. Sci, vol.63, issue.1,2, pp.198-20738, 2009. ,
DOI : 10.1016/0304-3975(96)00028-X
Characterization of Glushkov automata, Theoretical Computer Science, vol.233, issue.1-2, pp.75-90, 2000. ,
DOI : 10.1016/S0304-3975(97)00296-X
Two-Way Transducers with a Two-Way Output Tape, DLT'12, pp.263-272, 2012. ,
DOI : 10.1007/978-3-642-31653-1_24
Unambiguous B??chi automata, Theoretical Computer Science, vol.297, issue.1-3, pp.37-81, 2003. ,
DOI : 10.1016/S0304-3975(02)00618-7
Automata and semigroups recognizing infinite words, Logic and Automata, pp.133-168, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00340797
Random generation of DFAs, Theoretical Computer Science, vol.330, issue.2, pp.221-235, 2005. ,
DOI : 10.1016/j.tcs.2004.03.072
The Algebraic Theory of Semigroups, Mathematical Surveys and Monographs ,
Regular Algebra and Finite Machines, 1971. ,
Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.4-5577, 2004. ,
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267
From Two-Way to One-Way Finite State Transducers, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 1301. ,
DOI : 10.1109/LICS.2013.53
URL : https://hal.archives-ouvertes.fr/hal-00946161
A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994. ,
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729
THE ABSTRACT THEORY OF AUTOMATA, Russian Mathematical Surveys, vol.16, issue.5, pp.1-53, 1961. ,
DOI : 10.1070/RM1961v016n05ABEH004112
Parametric random generation of deterministic tree automata, Theoretical Computer Science, vol.411, issue.38-39, pp.38-393469, 2010. ,
DOI : 10.1016/j.tcs.2010.05.036
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
The number of initially connected automata, Cybernetics English translation of Kibernetika, vol.4, issue.3, pp.259-262, 1969. ,
Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006. ,
Approche structurelle de quelques problèmes de la théorie des automates, Th. : informatique et réseaux, 2001. ,
On the Construction of Reversible Automata for Reversible Languages, ICALP, pp.170-182, 2002. ,
DOI : 10.1007/3-540-45465-9_16
URL : https://hal.archives-ouvertes.fr/hal-00620037
Series which are both max-plus and min-plus rational are unambiguous. RAIRO -Theor, Inf. and Appl, vol.40, issue.1, pp.1-14, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00017220
Star Height of Reversible Languages and Universal Automata, pp.76-90, 2002. ,
DOI : 10.1007/3-540-45995-2_12
URL : https://hal.archives-ouvertes.fr/hal-00017159
The universal automaton, Logic and Automata, pp.457-504, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00620807
THE VALIDITY OF WEIGHTED AUTOMATA, International Journal of Algebra and Computation, vol.23, issue.04, pp.863-913, 2013. ,
DOI : 10.1142/S0218196713400146
URL : https://hal.archives-ouvertes.fr/hal-00845820
Regular expressions and finite state graphs for automata, IRE Trans. on Electronic Comput, issue.91, pp.38-47, 1960. ,
Random Generation of Directed Acyclic Graphs, Electronic Notes in Discrete Mathematics, vol.10, pp.202-207, 2001. ,
DOI : 10.1016/S1571-0653(04)00394-4
Generating connected acyclic digraphs uniformly at random, Information Processing Letters, vol.90, issue.4, pp.209-213, 2004. ,
DOI : 10.1016/j.ipl.2003.06.002
String-matching with automata, Nord. J. Comput, vol.4, issue.2, pp.217-231, 1997. ,
Semigroups and Automata on Infinite Words, Semigroups, Formal Languages and Groups, pp.49-72, 1995. ,
DOI : 10.1007/978-94-011-0149-3_3
MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON, International Journal of Foundations of Computer Science, vol.16, issue.05, pp.999-1010, 2005. ,
DOI : 10.1142/S0129054105003431
Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125181, 1959. ,
DOI : 10.1147/rd.32.0114
Elements of Automata Theory, 2009. ,
DOI : 10.1017/CBO9781139195218
The Reduction of Two-Way Automata to One-Way Automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959. ,
DOI : 10.1147/rd.32.0198
Programming Techniques: Regular expression search algorithm, Communications of the ACM, vol.11, issue.6, pp.419-422, 1968. ,
DOI : 10.1145/363347.363387