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

Edward Lieblein

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

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

Theory of computation · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
cellular automata
0.011969
A Unifying Framework for the Theory of Iterative Arrays of Machines · STOC 1969
Automata and formal languages
finite automata
0.011969
A Unifying Framework for the Theory of Iterative Arrays of Machines · STOC 1969
Automata and formal languages › cellular automata
iterative arrays
0.011969
A Unifying Framework for the Theory of Iterative Arrays of Machines · STOC 1969

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

mathematical framework · 0.0
YearPublicationVenuePosition
1969 A Unifying Framework for the Theory of Iterative Arrays of Machines
abstract
A mathematical framework is defined in which many questions concerning uniform arrays of finite-state machines can be formulated and studied. An outline is then presented that informally describes some research areas that have been under investigation. Some of the results uncovered to date are described and many open problems are stated.
Serafino Amoroso, Edward Lieblein, Hisao Yamada
STOC2