Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Caucal, Didier"'
Autor:
Caucal, Didier, Rispal, Chloé
For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b < a, we rea
Externí odkaz:
http://arxiv.org/abs/2205.14018
Autor:
Caucal, Didier
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
Comment: 26 pages, 26 figures
Comment: 26 pages, 26 figures
Externí odkaz:
http://arxiv.org/abs/1903.06521
Autor:
Caucal, Didier
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
Externí odkaz:
http://arxiv.org/abs/1803.08518
Autor:
Caucal, Didier
We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle language,
Externí odkaz:
http://arxiv.org/abs/1609.08272
Autor:
Caucal, Didier
Publikováno v:
Accès au texte intégral.
Habilitation à diriger des recherches : Informatique : Rennes 1 : 1998.
Bibliogr. p.61-65.
Bibliogr. p.61-65.
Autor:
Caucal, Didier1 caucal@univ-mlv.fr, Knapik, Teodor2 knapik@univ-nc.nc
Publikováno v:
Fundamenta Informaticae. 2018, Vol. 159 Issue 4, p327-359. 33p.
Autor:
Caucal, Didier
Publikováno v:
SANDGAL
SANDGAL, Jun 2019, Cremona, Italy
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-16⟩
SANDGAL, Jun 2019, Cremona, Italy
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-16⟩
Discrete Mathematics & Theoretical Computer Science ; vol. 21 no. 1, ICGT 2018 ; 1365-8050
International audience
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancell
International audience
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancell
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::504b0a9bf18af376cbe8c20eb797c012
https://hal.archives-ouvertes.fr/hal-01909189v3/document
https://hal.archives-ouvertes.fr/hal-01909189v3/document
Autor:
Caucal, Didier, Knapik, Teodor
Publikováno v:
Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS 2011
FSTTCS 2011, Dec 2011, Mumbai, India. pp.469-480, ⟨10.4230/LIPIcs.FSTTCS.2011.469⟩
FSTTCS 2011
FSTTCS 2011, Dec 2011, Mumbai, India. pp.469-480, ⟨10.4230/LIPIcs.FSTTCS.2011.469⟩
International audience; A word rewriting system is called monadic if each of its right hand sides is either a single letter or the empty word. We study the images of higher order indexed languages (defined by Maslov) under inverse derivations of infi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e7b2f74cb2cdb0035e9c94d8d5eaf8b
https://hal.archives-ouvertes.fr/hal-00867571
https://hal.archives-ouvertes.fr/hal-00867571