◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Nicaud

10 papers hereh-index 15696 citations70 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author6
  • last author4

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • math.GR4
  • cs.DS2
  • cs.FL2
  • cs.CG1
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20092025
most citedWeakly-unambiguous Parikh automata and their link to holonomic series

5 citations · 6 across the 7 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

cs.DS2009★ 1 cited

On the Average Complexity of Moore's State Minimization Algorithm

Frédérique Bassino, Julien David, Cyril Nicaud

We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.