bibliographer - Cyril Nicaud

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Weakly-unambiguous Parikh automata and their link to holonomic series Alin Bostan Arnaud Carayol Florent Koechlin Cyril Nicaud [github]

Random Deterministic Automata With One Added Transition Arnaud Carayol Philippe Duchon Florent Koechlin Cyril Nicaud [github]

Random DFA With One Added Transition Arnaud Carayol Philippe Duchon Florent Koechlin Cyril Nicaud [github]

Some Families of Trees Arising in Permutation Analysis Mathilde Bouvel Marni Mishna Cyril Nicaud [github]

One Drop of Non-Determinism in a Random Deterministic Automaton Arnaud Carayol Philippe Duchon Florent Koechlin Cyril Nicaud [github]

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series Alin Bostan Arnaud Carayol Florent Koechlin Cyril Nicaud [github]

Random Deterministic Automata Cyril Nicaud [github]

Fast Synchronization of Random Automata Cyril Nicaud [github]

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata Sven De Felice Cyril Nicaud [github]

Average Case Analysis of Moore's State Minimization Algorithm Frédérique Bassino Julien David Cyril Nicaud [github]

Parametric random generation of deterministic tree automata Pierre-Cyrille Héam Cyril Nicaud Sylvain Schmitz [github]

Library Size: 13G (11 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]