Demo Data from EDBT 2026 / reviewers in the wild / expert
Theodore T. Tylaska
dblp:61/1551
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1975
—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% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
hardware verification and test |
0.0 | 1 | 1975 | An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing Sequences · IEEE Trans. Computers 1975 |
Automata and formal languages › finite automata › finite state machine testing
checking experiments |
0.0 | 1 | 1975 | An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing Sequences · IEEE Trans. Computers 1975 |
Automata and formal languages
finite automata |
0.0 | 1 | 1975 | An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing Sequences · IEEE Trans. Computers 1975 |
Automata and formal languages › finite automata
finite state machine testing |
0.0 | 1 | 1975 | An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing Sequences · IEEE Trans. Computers 1975 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | An Improved Bound for Checking Experiments that Use Simple Input-Output and Characterizing SequencesabstractThe least upper bound of n(n−1)/2 input symbols is derived for the total length of characterizing sequences for a reduced n-state machine. When a machine can be characterized by a set of r characterizing sequences, a reduced upper bound on their total length will be r(2n−r−1)/2 input symbols. To shorten transfer sequences, better use is made of the strong-connectedness assumptions of the machines to be tested. The reduced bounds on characterizing and transfer sequences are utilized to improve the upper bounds on checking experiments employing simple input/output (I/O) sequences. Theodore T. Tylaska, James D. Bargainer |
IEEE Trans. Computers | 1 |