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

Bruce C. Moore

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

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

Theory 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
1 paper
Coding theory · 67% Automata and formal languages · 33%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
convolutional codes
0.011973
A new characterization of feedforward delay-free inverses (Corresp.) · IEEE Trans. Inf. Theory 1973
Coding theory › error-correcting codes › convolutional codes
feedforward inverse
0.011973
A new characterization of feedforward delay-free inverses (Corresp.) · IEEE Trans. Inf. Theory 1973
Automata and formal languages › finite automata › sequential machines
linear sequential circuits
0.011973
A new characterization of feedforward delay-free inverses (Corresp.) · IEEE Trans. Inf. Theory 1973

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

transfer-function matrix analysis · 0.0
YearPublicationVenuePosition
1973 A new characterization of feedforward delay-free inverses (Corresp.)
abstract
A necessary and sufficient condition for a linear sequential circuit to possess a feedforward inverse is given for the class of linear sequential circuits that possess delay-free inverses. Unlike previous work, this condition is given in terms of the difference (state) equation matrices rather than minors of the system transfer-function matrix. The constructive proof yields the following corollary: if a linear sequential circuit requiringnmemory elements has a feedforward delay-free inverse, then there exists at least one such inverse that requires no more thannmemory elements.
Bruce C. Moore, Leonard M. Silverman
IEEE Trans. Inf. Theory1