Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Y. Wakimura

dblp:40/3579 · DBLP profile ↗
← Back
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%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata › finite state machine testing
checking experiments		 0.011975
Comments on "Checking Experiments for Sequential Machines" · IEEE Trans. Computers 1975
Automata and formal languages › finite automata
sequential machines		 0.011975
Comments on "Checking Experiments for Sequential Machines" · IEEE Trans. Computers 1975

Methods — techniques the papers use, named apart from their topics

counterexample construction · 0.0
YearPublicationVenuePosition
1975 Comments on "Checking Experiments for Sequential Machines"
abstract
This correspondence comments on the statement, described in the above-mentioned paper,1 which follows after a few definitions characterizing input-output sequences for the design of checking experiments. Namely, a counterexample will be shown for one of the two statements. Furthermore, three generalized properties useful to demonstrate the above counterexample are presented.
Y. Wakimura, Nobuaki Yoshida
 IEEE Trans. Computers1