Demo Data from EDBT 2026 / reviewers in the wild / expert
Jonathan Goldstine
dblp:34/6585
· DBLP profile ↗
21ranked-venue papers
12as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 21 · 12 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
6 papers |
Automata and formal languages · 72% Computational complexity · 26% Logic in computer science · 2% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
finite automata |
0.0 | 2 | 1992 | On the Relation between Ambiguity and Nondeterminism in Finite Automata · Inf. Comput. 1992 On Measuring Nondeterminism in Regular Languages · Inf. Comput. 1990 |
Computational complexity › nondeterminism
nondeterminism measures |
0.0 | 1 | 1990 | On Measuring Nondeterminism in Regular Languages · Inf. Comput. 1990 |
Automata and formal languages
regular languages |
0.0 | 1 | 1992 | On the Relation between Ambiguity and Nondeterminism in Finite Automata · Inf. Comput. 1992 |
Automata and formal languages
context-free languages |
0.0 | 2 | 1980 | A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages · Inf. Control. 1980 Uniformly Erasable AFL · STOC 1972 |
Automata and formal languages › formal language classes
abstract family of languages |
0.0 | 3 | 1973 | Intersection-Closed Full AFL and the Recursively Enumerable Languages · Inf. Control. 1973 Uniformly Erasable AFL · STOC 1972 Intersection-Closed full AFL and the Recursively Enumerable Languages · STOC 1971 |
Automata and formal languages › formal language classes
recursively enumerable languages |
0.0 | 2 | 1973 | Intersection-Closed full AFL and the Recursively Enumerable Languages · STOC 1971 Intersection-Closed Full AFL and the Recursively Enumerable Languages · Inf. Control. 1973 |
Logic in computer science
containment |
0.0 | 1 | 1971 | Intersection-Closed full AFL and the Recursively Enumerable Languages · STOC 1971 |
Automata and formal languages › context-free languages
one-counter languages |
0.0 | 1 | 1972 | Uniformly Erasable AFL · STOC 1972 |
Methods — techniques the papers use, named apart from their topics
formal language theory · 0.0closure properties · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Measuring nondeterminism in pushdown automata
Jonathan Goldstine, Hing Leung, Detlef Wotschke |
J. Comput. Syst. Sci. | 1 |
| 1997 | Measuring Nondeterminism in Pushdown Automata
Jonathan Goldstine, Hing Leung, Detlef Wotschke |
STACS | 1 |
| 1993 | On Reducing the Number of Stack Symbols in a PDA
Jonathan Goldstine, John K. Price, Detlef Wotschke |
Math. Syst. Theory | 1 |
| 1992 | On the Relation between Ambiguity and Nondeterminism in Finite Automata
Jonathan Goldstine, Hing Leung, Detlef Wotschke |
Inf. Comput. | 1 |
| 1990 | On Measuring Nondeterminism in Regular Languages
Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke |
Inf. Comput. | 1 |
| 1983 | On the Equality of Grammatical Families
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier |
J. Comput. Syst. Sci. | 2 |
| 1982 | A Prime Decomposition Theorem for Grammatical Families
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier |
J. Comput. Syst. Sci. | 2 |
| 1982 | On Reducing the Number of States in a PDA
Jonathan Goldstine, John K. Price, Detlef Wotschke |
Math. Syst. Theory | 1 |
| 1982 | A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?
Jonathan Goldstine, John K. Price, Detlef Wotschke |
Theor. Comput. Sci. | 1 |
| 1980 | A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages
Leslie Paul Jones, Jonathan Goldstine |
Inf. Control. | 2 |
| 1979 | A Rational Theory of AFLS
Jonathan Goldstine |
ICALP | 1 |
| 1977 | Continuous Operations on Languages
Jonathan Goldstine |
Math. Syst. Theory | 1 |
| 1976 | Bounded AFLs
Jonathan Goldstine |
J. Comput. Syst. Sci. | 1 |
| 1976 | Some Uniformly Erasable Families of Languages
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach |
Theor. Comput. Sci. | 2 |
| 1975 | Uniformly Erasable AFL
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach |
J. Comput. Syst. Sci. | 2 |
| 1975 | Some Independent Families of One-Letter Languages
Jonathan Goldstine |
J. Comput. Syst. Sci. | 1 |
| 1973 | Intersection-Closed Full AFL and the Recursively Enumerable Languages
Seymour Ginsburg, Jonathan Goldstine |
Inf. Control. | 2 |
| 1972 | Uniformly Erasable AFLabstractThe purpose of this paper is to show that a number of well-known families have property (*). In particular, we prove that the family of context-free languages does indeed have this property. In addition, we show that several familiar subfamilies of the context-free languages, such as the one-counter languages, have property (*). Finally, we show that there are families satisfying (*) which are not subfamilies of the context-free languages, for we prove that any family generated from one-letter languages has property (*), thereby extending a result of [17]. Sheila A. Greibach, Seymour Ginsburg, Jonathan Goldstine |
STOC | 3 |
| 1972 | Substitution and Bounded Languages
Jonathan Goldstine |
J. Comput. Syst. Sci. | 1 |
| 1972 | On the Largest Full SubAFL of an AFL
Seymour Ginsburg, Jonathan Goldstine |
Math. Syst. Theory | 2 |
| 1971 | Intersection-Closed full AFL and the Recursively Enumerable Languagesabstract@ a* and the ratio of the number of words in L of length less than n to n goes to 1 as [equation], then [equation] does not contain all recursively enumerable languages. Seymour Ginsburg, Jonathan Goldstine |
STOC | 2 |