Demo Data from EDBT 2026 / reviewers in the wild / expert
L. P. J. Veelenturf
dblp:01/5559
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1978
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › grammatical inference
machine identification |
0.0 | 1 | 1978 | Inference of Sequential Machines from Sample Computations · IEEE Trans. Computers 1978 |
Automata and formal languages › automata algorithms
state minimization |
0.0 | 1 | 1978 | Inference of Sequential Machines from Sample Computations · IEEE Trans. Computers 1978 |
Methods — techniques the papers use, named apart from their topics
state minimization · 0.0sample computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1978 | Inference of Sequential Machines from Sample ComputationsabstractThis correspondence presents and justifies an algorithm for finding a minimal, though not a smallest, finite sequential machine with a behavior comprising a given finite sample of input-output behavior of some unknown sequential machine. When the number of states n of the machine to be identified is known and the sample contains all input-output pairs of length 2n - 1, the machine found will be equivalent to the original machine and will be minimal. L. P. J. Veelenturf |
IEEE Trans. Computers | 1 |