| Publication | Date of Publication | Type |
|---|
Analysis of the rate functions of large deviations for symbol statistics Journal of Automata, Languages and Combinatorics | 2025-11-25 | Paper |
Large deviation properties for pattern statistics in primitive rational models Theoretical Computer Science | 2025-02-12 | Paper |
Local limit laws for symbol statistics in bicomponent rational models Theoretical Computer Science | 2023-08-08 | Paper |
| Large deviation properties for pattern statistics in primitive rational models | 2023-06-13 | Paper |
| Number of prefixes in trace monoids: clique polynomials and dependency graphs | 2022-12-16 | Paper |
Rational transductions and complexity of counting problems Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
| A local limit property for pattern statistics in bicomponent stochastic models | 2020-06-30 | Paper |
| Analysis of symbol statistics in bicomponent rational models | 2019-10-15 | Paper |
On the complexity of clustering with relaxed size constraints in fixed dimension Theoretical Computer Science | 2018-03-13 | Paper |
Obituary: Alberto Bertoni: a scientist and a friend Theoretical Computer Science | 2017-03-16 | Paper |
On the Complexity of Clustering with Relaxed Size Constraints Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Clique polynomials have a unique root of smallest modulus Information Processing Letters | 2016-06-16 | Paper |
Exact algorithms for size constrained 2-clustering in the plane Theoretical Computer Science | 2016-05-27 | Paper |
Exact algorithms for 2-clustering with size constraints in the Euclidean plane Lecture Notes in Computer Science | 2015-02-20 | Paper |
Size constrained distance clustering: separation properties and some complexity results Fundamenta Informaticae | 2012-05-11 | Paper |
Efficient recognition of trace languages defined by repeat-until loops Information and Computation | 2010-08-19 | Paper |
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases Fundamenta Informaticae | 2009-06-23 | Paper |
Interacting with an artificial partner: modeling the role of emotional aspects Biological Cybernetics | 2009-02-03 | Paper |
Average Value and Variance of Pattern Statistics in Rational Models Implementation and Application of Automata | 2008-06-10 | Paper |
STACS 2004 Lecture Notes in Computer Science | 2007-10-01 | Paper |
On the Complexity of Unary Tiling-Recognizable Picture Languages STACS 2007 | 2007-09-03 | Paper |
Probabilistic models for pattern statistics RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Probabilistic models for pattern statistics RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Probabilistic models for pattern statistics RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Preface RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Preface RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Local limit properties for pattern statistics and rational models Theory of Computing Systems | 2006-10-25 | Paper |
Pattern statistics and Vandermonde matrices. Theoretical Computer Science | 2006-05-18 | Paper |
Developments in Language Theory Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005 Lecture Notes in Computer Science | 2005-12-02 | Paper |
Frequency of symbol occurrences in bicomponent stochastic models Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2051178 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2040910 (Why is no real title available?) | 2004-02-11 | Paper |
On the number of occurrences of a symbol in words of regular languages. Theoretical Computer Science | 2003-08-17 | Paper |
Random Generation for Finitely Ambiguous Context-free Languages RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Random Generation for Finitely Ambiguous Context-free Languages RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Random Generation for Finitely Ambiguous Context-free Languages RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
| scientific article; zbMATH DE number 1688372 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1500544 (Why is no real title available?) | 2001-06-13 | Paper |
| scientific article; zbMATH DE number 1530301 (Why is no real title available?) | 2000-11-14 | Paper |
Determinants and Möbius functions in trace monoids Discrete Mathematics | 2000-01-31 | Paper |
Random generation of words in an algebraic language in linear binary space Information Processing Letters | 1997-02-28 | Paper |
Rational transductions and complexity of counting problems Mathematical Systems Theory | 1995-11-14 | Paper |
On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions RAIRO - Theoretical Informatics and Applications | 1993-06-29 | Paper |
Probabilistic estimation of the number of prefixes of a trace Theoretical Computer Science | 1992-06-28 | Paper |
The complexity of computing the number of strings of given length in context-free languages Theoretical Computer Science | 1992-06-26 | Paper |
Ranking and formal power series Theoretical Computer Science | 1991-01-01 | Paper |
Counting problems and algebraic formal power series in noncommuting variables Information Processing Letters | 1990-01-01 | Paper |
SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4114058 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4058887 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4033108 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4024789 (Why is no real title available?) | 1987-01-01 | Paper |