No. Title Author Year
1 Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series Bostan, Alin et al. 2020
2 An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting Goaoc, Xavier et al. 2019
3 Uniform Random Expressions Lack Expressivity Koechlin, Florent et al. 2019
4 On the Worst-Case Complexity of TimSort Auger, Nicolas et al. 2018
5 Gapped Pattern Statistics Duchon, Philippe et al. 2017
6 Estimating Statistics on Words Using Ambiguous Descriptions Nicaud, Cyril 2016
7 Fast Synchronization of Random Automata Nicaud, Cyril 2016
8 Good Predictions Are Worth a Few Comparisons Auger, Nicolas et al. 2016
9 Distribution of the number of accessible states in a random deterministic automaton Carayol, Arnaud et al. 2012
10 Average Analysis of Glushkov Automata under a BST-Like Model Nicaud, Cyril et al. 2010
11 On the Average Complexity of Moore's State Minimization Algorithm Bassino, Frederique et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI