default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Goldstine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j21]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71(4): 440-466 (2005)- 2002
- [j20]Eileen Peluso, Jonathan Goldstine, Shashi Phoha:
Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems. J. Autom. Lang. Comb. 7(1): 127-142 (2002) - [j19]Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. 8(2): 193-234 (2002)
1990 – 1999
- 1997
- [c4]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata. STACS 1997: 295-306 - 1995
- [j18]Stephen R. Tate, David B. Benson, Jonathan Goldstine:
Book Reviews. SIGACT News 26(2): 26-32 (1995) - 1993
- [j17]Jonathan Goldstine, John K. Price, Detlef Wotschke:
On Reducing the Number of Stack Symbols in a PDA. Math. Syst. Theory 26(4): 313-326 (1993) - 1992
- [j16]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata. Inf. Comput. 100(2): 261-270 (1992) - 1990
- [j15]Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke:
On Measuring Nondeterminism in Regular Languages. Inf. Comput. 86(2): 179-194 (1990)
1980 – 1989
- 1983
- [j14]Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier:
On the Equality of Grammatical Families. J. Comput. Syst. Sci. 26(2): 171-196 (1983) - 1982
- [j13]Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier:
A Prime Decomposition Theorem for Grammatical Families. J. Comput. Syst. Sci. 24(3): 315-361 (1982) - [j12]Jonathan Goldstine, John K. Price, Detlef Wotschke:
On Reducing the Number of States in a PDA. Math. Syst. Theory 15(4): 315-321 (1982) - [j11]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
- [j10]Leslie Paul Jones, Jonathan Goldstine:
A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages. Inf. Control. 47(3): 220-236 (1980)
1970 – 1979
- 1979
- [c3]Jonathan Goldstine:
A Rational Theory of AFLS. ICALP 1979: 271-281 - 1977
- [j9]Jonathan Goldstine:
A simplified proof of Parikh's theorem. Discret. Math. 19(3): 235-239 (1977) - [j8]Jonathan Goldstine:
Continuous Operations on Languages. Math. Syst. Theory 11: 29-46 (1977) - 1976
- [j7]Jonathan Goldstine:
Bounded AFLs. J. Comput. Syst. Sci. 12(3): 399-419 (1976) - [j6]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976) - 1975
- [j5]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975) - [j4]Jonathan Goldstine:
Some Independent Families of One-Letter Languages. J. Comput. Syst. Sci. 10(3): 351-369 (1975) - 1973
- [j3]Seymour Ginsburg, Jonathan Goldstine:
Intersection-Closed Full AFL and the Recursively Enumerable Languages. Inf. Control. 22(3): 201-231 (1973) - 1972
- [j2]Jonathan Goldstine:
Substitution and Bounded Languages. J. Comput. Syst. Sci. 6(1): 9-29 (1972) - [j1]Seymour Ginsburg, Jonathan Goldstine:
On the Largest Full SubAFL of an AFL. Math. Syst. Theory 6(3): 241-242 (1972) - [c2]Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
Uniformly Erasable AFL. STOC 1972: 207-213 - 1971
- [c1]Seymour Ginsburg, Jonathan Goldstine:
Intersection-Closed full AFL and the Recursively Enumerable Languages. STOC 1971: 121-131
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
