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 VLDB 2026 / reviewers in the wild / expert

Isao Ohbayashi

dblp:178/6085 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1970
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

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 › sequential machines
finite-memory sequential machine		 0.011970
On Finite-Memory Sequential Machines · IEEE Trans. Computers 1970
Automata and formal languages › finite automata
sequential machines		 0.011970
On Finite-Memory Sequential Machines · IEEE Trans. Computers 1970
YearPublicationVenuePosition
1970 On Finite-Memory Sequential Machines
abstract
This paper shows that 1) there exist at least four types of binary-input binary-output maximum-memory n-state machines for any n; 2) there exist binary-input ternary-output maximum output -memory n-state machines for any n; and 3) there exists a binary- input binary-output maximum output-memory n-state machine for n≤5.
Yahiko Kambayashi, Shuzo Yajima, Isao Ohbayashi
 IEEE Trans. Computers3