| 2005 |
|---|
| 23 | EE | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci. 71(4): 440-466 (2005) |
| 2002 |
|---|
| 22 | EE | Jonathan Goldstine,
Martin Kappes,
Chandra M. R. Kintala,
Hing Leung,
Andreas Malcher,
Detlef Wotschke:
Descriptional Complexity of Machines with Limited Resources.
J. UCS 8(2): 193-234 (2002) |
| 21 | | Eileen Peluso,
Jonathan Goldstine,
Shashi Phoha:
Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems.
Journal of Automata, Languages and Combinatorics 7(1): 127-142 (2002) |
| 1997 |
|---|
| 20 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata.
STACS 1997: 295-306 |
| 1993 |
|---|
| 19 | | Jonathan Goldstine,
John K. Price,
Detlef Wotschke:
On Reducing the Number of Stack Symbols in a PDA.
Mathematical Systems Theory 26(4): 313-326 (1993) |
| 1992 |
|---|
| 18 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput. 100(2): 261-270 (1992) |
| 1990 |
|---|
| 17 | | Jonathan Goldstine,
Chandra M. R. Kintala,
Detlef Wotschke:
On Measuring Nondeterminism in Regular Languages
Inf. Comput. 86(2): 179-194 (1990) |
| 1983 |
|---|
| 16 | | Seymour Ginsburg,
Jonathan Goldstine,
Edwin H. Spanier:
On the Equality of Grammatical Families.
J. Comput. Syst. Sci. 26(2): 171-196 (1983) |
| 1982 |
|---|
| 15 | | Seymour Ginsburg,
Jonathan Goldstine,
Edwin H. Spanier:
A Prime Decomposition Theorem for Grammatical Families.
J. Comput. Syst. Sci. 24(3): 315-361 (1982) |
| 14 | | Jonathan Goldstine,
John K. Price,
Detlef Wotschke:
On Reducing the Number of States in a PDA.
Mathematical Systems Theory 15(4): 315-321 (1982) |
| 13 | | Jonathan Goldstine,
John K. Price,
Detlef Wotschke:
A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?
Theor. Comput. Sci. 18: 33-40 (1982) |
| 1980 |
|---|
| 12 | | Leslie Paul Jones,
Jonathan Goldstine:
A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages
Information and Control 47(3): 220-236 (1980) |
| 1979 |
|---|
| 11 | | Jonathan Goldstine:
A Rational Theory of AFLS.
ICALP 1979: 271-281 |
| 1977 |
|---|
| 10 | | Jonathan Goldstine:
Continuous Operations on Languages.
Mathematical Systems Theory 11: 29-46 (1977) |
| 1976 |
|---|
| 9 | | Jonathan Goldstine:
Bounded AFLs.
J. Comput. Syst. Sci. 12(3): 399-419 (1976) |
| 8 | | Seymour Ginsburg,
Jonathan Goldstine,
Sheila A. Greibach:
Some Uniformly Erasable Families of Languages.
Theor. Comput. Sci. 2(1): 29-44 (1976) |
| 1975 |
|---|
| 7 | | Seymour Ginsburg,
Jonathan Goldstine,
Sheila A. Greibach:
Uniformly Erasable AFL.
J. Comput. Syst. Sci. 10(2): 165-182 (1975) |
| 6 | | Jonathan Goldstine:
Some Independent Families of One-Letter Languages.
J. Comput. Syst. Sci. 10(3): 351-369 (1975) |
| 1973 |
|---|
| 5 | | Seymour Ginsburg,
Jonathan Goldstine:
Intersection-Closed Full AFL and the Recursively Enumerable Languages
Information and Control 22(3): 201-231 (1973) |
| 1972 |
|---|
| 4 | | Sheila Carlyle-Greibach,
Seymour Ginsburg,
Jonathan Goldstine:
Uniformly Erasable AFL
STOC 1972: 207-213 |
| 3 | | Jonathan Goldstine:
Substitution and Bounded Languages.
J. Comput. Syst. Sci. 6(1): 9-29 (1972) |
| 2 | | Seymour Ginsburg,
Jonathan Goldstine:
On the Largest Full SubAFL of an AFL.
Mathematical Systems Theory 6(3): 241-242 (1972) |
| 1971 |
|---|
| 1 | | Seymour Ginsburg,
Jonathan Goldstine:
Intersection-Closed full AFL and the Recursively Enumerable Languages
STOC 1971: 121-131 |
