Search results for "Cyril Nicaud"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Frédérique Bassino, Julien David, Cyril Nicaud	Average Case Analysis of Moore's State Minimization Algorithm.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Cyril Nicaud	Distribution of the number of accessible states in a random deterministic automaton.	STACS	2012	DBLP DOI BibTeX RDF
1	Sarah Behrens, Cyril Nicaud, Pierre Nicodème	An automaton approach for waiting times in DNA evolution	CoRR	2011	DBLP BibTeX RDF
1	Pierre-Cyrille Héam, Cyril Nicaud	Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing.	ICST	2011	DBLP DOI BibTeX RDF
1	Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz	Parametric random generation of deterministic tree automata.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Laura Giambruno, Cyril Nicaud	The Average State Complexity of Rational Operations on Finite Languages.	Int. J. Found. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil	Statistical properties of subgroups of free groups	CoRR	2010	DBLP BibTeX RDF
1	Frédérique Bassino, Laura Giambruno, Cyril Nicaud	Complexity of Operations on Cofinite Languages.	LATIN	2010	DBLP DOI BibTeX RDF
1	Omar AitMous, Frédérique Bassino, Cyril Nicaud	Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality.	CPM	2010	DBLP DOI BibTeX RDF
1	Giusi Castiglione, Cyril Nicaud, Marinella Sciortino	A Challenging Family of Automata for Classical Minimization Algorithms.	CIAA	2010	DBLP DOI BibTeX RDF
1	Cyril Nicaud, Carine Pivoteau, Benoît Razet	Average Analysis of Glushkov Automata under a BST-Like Model.	FSTTCS	2010	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien David, Cyril Nicaud	On the Average Complexity of Moore's State Minimization Algorithm	CoRR	2009	DBLP BibTeX RDF
1	Otfried Cheong, Xavier Goaoc, Cyril Nicaud	Set Systems and Families of Permutations with Small Traces	CoRR	2009	DBLP BibTeX RDF
1	Cyril Nicaud	On the Average Size of Glushkov's Automata.	LATA	2009	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien David, Cyril Nicaud	On the Average Complexity of Moore's State Minimization Algorithm.	STACS	2009	DBLP DOI BibTeX RDF
1	Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz	Random Generation of Deterministic Tree (Walking) Automata.	CIAA	2009	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Cyril Nicaud, Pascal Weil	Random Generation of Finitely Generated Subgroups of a Free Group.	IJAC	2008	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Laura Giambruno, Cyril Nicaud	The Average State Complexity of the Star of a Finite Set of Words Is Linear.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Cyril Nicaud	Enumeration and random generation of accessible automata.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien David, Cyril Nicaud	: A Library to Randomly and Exhaustively Generate Automata.	CIAA	2007	DBLP DOI BibTeX RDF	C++ library, finite automata, random generation
1	Frédérique Bassino, Julien Clément, Cyril Nicaud	The standard factorization of Lyndon words: an average point of view.	Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien Clément, Cyril Nicaud	Lyndon words with a fixed standard right factor.	SODA	2004	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien Clément, Cyril Nicaud	The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
1	Cyril Nicaud	Average State Complexity of Operations on Unary Automata.	MFCS	1999	DBLP DOI BibTeX RDF

Publications of "Cyril Nicaud" ( http://dblp.L3S.de/Authors/Cyril_Nicaud )