Jonathan Goldstine - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2005

Measuring nondeterminism in pushdown automataJonathan Goldstine, Hing Leung, Detlef Wotschke. jcss, 71(4):440-466, 2005. [doi]

2002

Descriptional Complexity of Machines with Limited ResourcesJonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke. jucs, 8(2):193-234, 2002. [doi]

Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event SystemsEileen Peluso, Jonathan Goldstine, Shashi Phoha. jalc, 7(1):127-142, 2002.

1997

Measuring Nondeterminism in Pushdown AutomataJonathan Goldstine, Hing Leung, Detlef Wotschke. STACS 1997: 295-306

1995

Book ReviewsStephen R. Tate, David B. Benson, Jonathan Goldstine. sigact, 26(2):26-32, 1995. [doi]

1993

On Reducing the Number of Stack Symbols in a PDAJonathan Goldstine, John K. Price, Detlef Wotschke. mst, 26(4):313-326, 1993.

1992

On the Relation between Ambiguity and Nondeterminism in Finite AutomataJonathan Goldstine, Hing Leung, Detlef Wotschke. iandc, 100(2):261-270, October 1992.

1990

On Measuring Nondeterminism in Regular LanguagesJonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke. iandc, 86(2):179-194, June 1990.

1983

On the Equality of Grammatical FamiliesSeymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier. jcss, 26(2):171-196, 1983.

1982

A Prime Decomposition Theorem for Grammatical FamiliesSeymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier. jcss, 24(3):315-361, 1982.

A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?Jonathan Goldstine, John K. Price, Detlef Wotschke. TCS, 18:33-40, 1982.

On Reducing the Number of States in a PDAJonathan Goldstine, John K. Price, Detlef Wotschke. mst, 15(4):315-321, 1982.

1980

A Characterization Theorem for Certain Bounded Deterministic Context-Free LanguagesLeslie Paul Jones, Jonathan Goldstine. iandc, 47(3):220-236, December 1980.

1979

A Rational Theory of AFLSJonathan Goldstine. icalp 1979: 271-281

1977

Continuous Operations on LanguagesJonathan Goldstine. mst, 11:29-46, 1977.

A simplified proof of Parikh's theoremJonathan Goldstine. DM, 19(3):235-239, 1977. [doi]

1976

Some Uniformly Erasable Families of LanguagesSeymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. TCS, 2(1):29-44, 1976.

Bounded AFLsJonathan Goldstine. jcss, 12(3):399-419, 1976.

1975

Uniformly Erasable AFLSeymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. jcss, 10(2):165-182, 1975.

Some Independent Families of One-Letter LanguagesJonathan Goldstine. jcss, 10(3):351-369, 1975.

1973

Intersection-Closed Full AFL and the Recursively Enumerable LanguagesSeymour Ginsburg, Jonathan Goldstine. iandc, 22(3):201-231, April 1973.

1972

Uniformly Erasable AFLSheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine. stoc 1972: 207-213

On the Largest Full SubAFL of an AFLSeymour Ginsburg, Jonathan Goldstine. mst, 6(3):241-242, 1972.

Substitution and Bounded LanguagesJonathan Goldstine. jcss, 6(1):9-29, 1972.

1971

Intersection-Closed full AFL and the Recursively Enumerable LanguagesSeymour Ginsburg, Jonathan Goldstine. stoc 1971: 121-131

Sign in or sign up to see more results.

runs on WebDSL