◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel Quernheim

4 papers hereh-index 593 citations23 works total

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

author position
  • last author4

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

fields
  • cs.FL4

identity via Semantic Scholar / OpenAlex

activity
20112017
most citedPushing for weighted tree automata

1 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing 2013 · cs.FLShow all

1 paper · 2 filters

cs.FL2013★ 1 cited

Random Generation of Nondeterministic Finite-State Tree Automata

Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtain…

◍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.