Jonathan Goldstine

According to our database, Jonathan Goldstine authored at least 22 papers between 1971 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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

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

1997

Measuring Nondeterminism in Pushdown Automata.

Jonathan Goldstine, Hing Leung, Detlef Wotschke

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1995

Book Reviews.

Stephen R. Tate, David B. Benson, Jonathan Goldstine

SIGACT News, 1995

1993

On Reducing the Number of Stack Symbols in a PDA.

Jonathan Goldstine, John K. Price, Detlef Wotschke

Math. Syst. Theory, 1993

1992

On the Relation between Ambiguity and Nondeterminism in Finite Automata

Jonathan Goldstine, Hing Leung, Detlef Wotschke

Inf. Comput., October, 1992

1990

On Measuring Nondeterminism in Regular Languages

Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke

Inf. Comput., June, 1990

1983

On the Equality of Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1983

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 Reducing the Number of States in a PDA.

Jonathan Goldstine, John K. Price, Detlef Wotschke

Math. Syst. Theory, 1982

A Prime Decomposition Theorem for Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1982

1980

A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages

Leslie Paul Jones, Jonathan Goldstine

Inf. Control., December, 1980

1979

A Rational Theory of AFLS.

Jonathan Goldstine

Proceedings of the Automata, 1979

1977

Continuous Operations on Languages.

Jonathan Goldstine

Math. Syst. Theory, 1977

A simplified proof of Parikh's theorem.

Jonathan Goldstine

Discret. Math., 1977

1976

Some Uniformly Erasable Families of Languages.

Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach

Theor. Comput. Sci., 1976

Bounded AFLs.

Jonathan Goldstine

J. Comput. Syst. Sci., 1976

1975

Some Independent Families of One-Letter Languages.

Jonathan Goldstine

J. Comput. Syst. Sci., 1975

1972

On the Largest Full SubAFL of an AFL.

Seymour Ginsburg, Jonathan Goldstine

Math. Syst. Theory, 1972

Substitution and Bounded Languages.

Jonathan Goldstine

J. Comput. Syst. Sci., 1972

Uniformly Erasable AFL

Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971

Intersection-Closed full AFL and the Recursively Enumerable Languages

Seymour Ginsburg, Jonathan Goldstine

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971