Substitution and Bounded Languages. - Jonathan Goldstine (J. Comput. Syst. Sci., 1972)

On the Largest Full SubAFL of an AFL. - Seymour Ginsburg; Jonathan Goldstine (Math. Syst. Theory, 1972)

Intersection-Closed Full AFL and the Recursively Enumerable Languages - Seymour Ginsburg; Jonathan Goldstine (Inf. Control., 1973)

Uniformly Erasable AFL. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (J. Comput. Syst. Sci., 1975)

Some Independent Families of One-Letter Languages. - Jonathan Goldstine (J. Comput. Syst. Sci., 1975)

Bounded AFLs. - Jonathan Goldstine (J. Comput. Syst. Sci., 1976)

Some Uniformly Erasable Families of Languages. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (Theor. Comput. Sci., 1976)

A simplified proof of Parikh's theorem. - Jonathan Goldstine (Discret. Math., 1977)

Continuous Operations on Languages. - Jonathan Goldstine (Math. Syst. Theory, 1977)

A Rational Theory of AFLS. - Jonathan Goldstine (ICALP, 1979)

A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages - Leslie Paul Jones; Jonathan Goldstine (Inf. Control., 1980)

A Prime Decomposition Theorem for Grammatical Families. - Seymour Ginsburg; Jonathan Goldstine; Edwin H. Spanier (J. Comput. Syst. Sci., 1982)

On Reducing the Number of States in a PDA. - Jonathan Goldstine; John K. Price; Detlef Wotschke (Math. Syst. Theory, 1982)

A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? - Jonathan Goldstine; John K. Price; Detlef Wotschke (Theor. Comput. Sci., 1982)

On the Equality of Grammatical Families. - Seymour Ginsburg; Jonathan Goldstine; Edwin H. Spanier (J. Comput. Syst. Sci., 1983)

On Measuring Nondeterminism in Regular Languages - Jonathan Goldstine; Chandra M. R. Kintala; Detlef Wotschke (Inf. Comput., 1990)

On the Relation between Ambiguity and Nondeterminism in Finite Automata - Jonathan Goldstine; Hing Leung; Detlef Wotschke (Inf. Comput., 1992)

On Reducing the Number of Stack Symbols in a PDA. - Jonathan Goldstine; John K. Price; Detlef Wotschke (Math. Syst. Theory, 1993)

Book Reviews. - Stephen R. Tate; David B. Benson; Jonathan Goldstine (SIGACT News, 1995)

Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems. - Eileen M. Peluso; Jonathan Goldstine; Shashi Phoha (J. Autom. Lang. Comb., 2002)

Descriptional Complexity of Machines with Limited Resources. - Jonathan Goldstine; Martin Kappes; Chandra M. R. Kintala; Hing Leung; Andreas Malcher; Detlef Wotschke (J. Univers. Comput. Sci., 2002)

Measuring nondeterminism in pushdown automata. - Jonathan Goldstine; Hing Leung; Detlef Wotschke (J. Comput. Syst. Sci., 2005)