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

D. Fraley

dblp:86/3346 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1976
—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 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › grammatical inference
machine identification
0.011976
A Realization Algorithm for Multiple Preset Experiments · IEEE Trans. Computers 1976

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

state coding · 0.0partition matrix construction · 0.0
YearPublicationVenuePosition
1976 A Realization Algorithm for Multiple Preset Experiments
abstract
An algorithm for the realization of an unknown maczine's flow table by preset multiple experiments is given. A method for coding the states of the unknown machine is used to expedite the construction of a partition matrix from which the flow table may be constructed.
D. Fraley, Joseph J. Talavage
IEEE Trans. Computers1