Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Cyril Nicaud"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees. For each subclass we provide asymptotic formulas for
Externí odkaz:
https://doaj.org/article/10fee74cdc8c41ec96322d196b697df2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
We consider a generalization of the uniform word-based distribution for finitely generated subgroups of a free group. In our setting, the number of generators is not fixed, the length of each generator is determined by a random variable with some sim
Externí odkaz:
https://doaj.org/article/c051cd3f540a46638a01690954756dbc
Autor:
Frédérique Bassino, Cyril Nicaud
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)
We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ n
Externí odkaz:
https://doaj.org/article/9935d85d78fa466f9622ecfa0b2fc791
Publikováno v:
International Journal of Foundations of Computer Science. 32:733-760
In this article, we study the impact of applying simple reduction rules to random syntactic formulas encoded as trees. We assume that there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform rand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b276ed31cd4f4c368669b76752b52d36
https://doi.org/10.1142/s0129054121420065
https://doi.org/10.1142/s0129054121420065
Autor:
Cyril Nicaud, Pablo Rotondo
Publikováno v:
International Journal of Foundations of Computer Science. 32:419-438
In this article, we study some properties of random regular expressions of size [Formula: see text], when the cardinality of the alphabet also depends on [Formula: see text]. For this, we revisit and improve the classical Transfer Theorem from the fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dec0dfadbfd8cfdc9457001778a4f3a7
https://doi.org/10.1142/s012905412141001x
https://doi.org/10.1142/s012905412141001x
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031221040
Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mechanism in Lua, is an associative array called a table. With Lua 5.0, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b2321c001bd96b19482318b7ef07772
https://doi.org/10.1007/978-3-031-22105-7_34
https://doi.org/10.1007/978-3-031-22105-7_34
Publikováno v:
International Journal of Algebra and Computation
International Journal of Algebra and Computation, World Scientific Publishing, 2021, 31 (08), pp.1691-1751. ⟨10.1142/S0218196721500624⟩
International Journal of Algebra and Computation, World Scientific Publishing, 2021, 31 (08), pp.1691-1751. ⟨10.1142/S0218196721500624⟩
We count the finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $\Gamma(H)$, we consider the number of vertices of $\Gamma(H)$ to be the siz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0437fc3be61021e687b29cd99214ec1
https://hal.archives-ouvertes.fr/hal-03507020
https://hal.archives-ouvertes.fr/hal-03507020
Autor:
Cyril Nicaud, Mikhail V. Berlinkov
Publikováno v:
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, World Scientific Publishing, 2020, 31 (08), pp.1091-1112. ⟨10.1142/S0129054120420058⟩
International Journal of Foundations of Computer Science, World Scientific Publishing, 2020, 31 (08), pp.1091-1112. ⟨10.1142/S0129054120420058⟩
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8f017cf36d24bdf60d30222afd8e963
https://hal.archives-ouvertes.fr/hal-03134003
https://hal.archives-ouvertes.fr/hal-03134003
Publikováno v:
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, Open Journal Systems, 2020, ⟨10.37236/6504⟩
The Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩
The Electronic Journal of Combinatorics, Open Journal Systems, 2020, ⟨10.37236/6504⟩
The Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these results to stron
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::428746857d195c8e4a3a830e63671ab8
https://doi.org/10.37236/6504
https://doi.org/10.37236/6504
Publikováno v:
Lecture Notes in Computer Science
International Conference on Developments in Language Theory (DLT 2020)
International Conference on Developments in Language Theory (DLT 2020), May 2020, Tampa, United States. pp.164-177, ⟨10.1007/978-3-030-48516-0_13⟩
Developments in Language Theory ISBN: 9783030485153
DLT
Developments in Language Theory
International Conference on Developments in Language Theory (DLT 2020)
International Conference on Developments in Language Theory (DLT 2020), May 2020, Tampa, United States. pp.164-177, ⟨10.1007/978-3-030-48516-0_13⟩
Developments in Language Theory ISBN: 9783030485153
DLT
Developments in Language Theory
International audience; We consider general expressions, which are trees whose nodes are labeled with operators, that represent syntactic descriptions of formulas. We assume that there is an operator that has an absorbing pattern and prove that if we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef2f9d94b93d045f17a433f47a09e893
https://hal.archives-ouvertes.fr/hal-03145943/document
https://hal.archives-ouvertes.fr/hal-03145943/document