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

B. G. Reynolds

dblp:26/746 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 1 first-authorTheory of computation · 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
2 papers
Automata and formal languages · 70% Coding theory · 24% Combinatorics and discrete mathematics · 6%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › algebraic automata theory › automata decomposition
cascade decomposition		 0.011969
Some Results on Cascade Decomposition of Automata · Inf. Control. 1969
Coding theory › finite fields
factorization		 0.011970
General Repetitive Events and Machines · IEEE Trans. Computers 1970
Automata and formal languages
finite automata		 0.011970
General Repetitive Events and Machines · IEEE Trans. Computers 1970
Automata and formal languages › regular languages
regular expressions		 0.011970
General Repetitive Events and Machines · IEEE Trans. Computers 1970

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

state graph analysis · 0.0
YearPublicationVenuePosition
1970 General Repetitive Events and Machines
abstract
A finite automaton is a general repetitive machine if there is a path in the state graph from every final state to the start state. In this paper general repetitive events are defined in terms of certain factorization properties of the associated regular expressions, and a one-to-one onto correspondence is shown between general repetitive machines and general repetitive events.
B. G. Reynolds
 IEEE Trans. Computers1
1969 Some Results on Cascade Decomposition of Automata
B. G. Reynolds
 Inf. Control.1