Jonathan Goldstine

25 papers A* 3A 1Journal 21
YearRankTypeTitle / Venue / Authors
2005 J jnl
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci.
Jonathan Goldstine, Hing Leung, Detlef Wotschke
2002 J jnl
Descriptional Complexity of Machines with Limited Resources.
J. Univers. Comput. Sci.
Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
2002 J jnl
Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems.
J. Autom. Lang. Comb.
Eileen M. Peluso, Jonathan Goldstine, Shashi Phoha
1997 A conf
Measuring Nondeterminism in Pushdown Automata.
STACS
Jonathan Goldstine, Hing Leung, Detlef Wotschke
1995 J jnl
Book Reviews.
SIGACT News
Stephen R. Tate, David B. Benson, Jonathan Goldstine
1993 J jnl
On Reducing the Number of Stack Symbols in a PDA.
Math. Syst. Theory
Jonathan Goldstine, John K. Price, Detlef Wotschke
1992 J jnl
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput.
Jonathan Goldstine, Hing Leung, Detlef Wotschke
1990 J jnl
On Measuring Nondeterminism in Regular Languages
Inf. Comput.
Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke
1983 J jnl
On the Equality of Grammatical Families.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
1982 J jnl
A Prime Decomposition Theorem for Grammatical Families.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
1982 J jnl
A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?
Theor. Comput. Sci.
Jonathan Goldstine, John K. Price, Detlef Wotschke
1982 J jnl
On Reducing the Number of States in a PDA.
Math. Syst. Theory
Jonathan Goldstine, John K. Price, Detlef Wotschke
1980 J jnl
A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages
Inf. Control.
Leslie Paul Jones, Jonathan Goldstine
1979 A* conf
A Rational Theory of AFLS.
ICALP
Jonathan Goldstine
1977 J jnl
A simplified proof of Parikh's theorem.
Discret. Math.
Jonathan Goldstine
1977 J jnl
Continuous Operations on Languages.
Math. Syst. Theory
Jonathan Goldstine
1976 J jnl
Bounded AFLs.
J. Comput. Syst. Sci.
Jonathan Goldstine
1976 J jnl
Some Uniformly Erasable Families of Languages.
Theor. Comput. Sci.
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
1975 J jnl
Some Independent Families of One-Letter Languages.
J. Comput. Syst. Sci.
Jonathan Goldstine
1975 J jnl
Uniformly Erasable AFL.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
1973 J jnl
Intersection-Closed Full AFL and the Recursively Enumerable Languages
Inf. Control.
Seymour Ginsburg, Jonathan Goldstine
1972 J jnl
On the Largest Full SubAFL of an AFL.
Math. Syst. Theory
Seymour Ginsburg, Jonathan Goldstine
1972 J jnl
Substitution and Bounded Languages.
J. Comput. Syst. Sci.
Jonathan Goldstine
1972 A* conf
Uniformly Erasable AFL
STOC
Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine
1971 A* conf
Intersection-Closed full AFL and the Recursively Enumerable Languages
STOC
Seymour Ginsburg, Jonathan Goldstine