The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jonathan Goldstine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.017secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002