EDBT 2026 Demo / reviewers in the wild / expert
A. Bouchet
dblp:117/0807
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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 · 67% Coding theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › lattice theory
distributive lattice |
0.0 | 1 | 1968 | An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine · IEEE Trans. Computers 1968 |
Automata and formal languages › finite automata
sequential machines |
0.0 | 1 | 1968 | An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine · IEEE Trans. Computers 1968 |
Automata and formal languages › automata algorithms
state minimization |
0.0 | 1 | 1968 | An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine · IEEE Trans. Computers 1968 |
Methods — techniques the papers use, named apart from their topics
partial covering · 0.0closed covering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1968 | An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential MachineabstractAbstract—A structure of distributive lattice is defined on the set of partial coverings of a finite nonempty set. From this structure is derived an algorithm for calculating a minimal closed covering of the states in an incomplete sequential machine. A. Bouchet |
IEEE Trans. Computers | 1 |