Jonathan Goldstine

From MaRDI portal
Person:584930

Available identifiers

zbMath Open goldstine.jonathanMaRDI QIDQ584930

List of research outcomes

PublicationDate of PublicationType
Measuring nondeterminism in pushdown automata2022-11-09Paper
https://portal.mardi4nfdi.de/entity/Q54222342007-10-17Paper
Measuring nondeterminism in pushdown automata2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q31502532002-09-30Paper
On reducing the number of stack symbols in a PDA1994-08-21Paper
On the relation between ambiguity and nondeterminism in finite automata1993-01-16Paper
On measuring nondeterminism in regular languages1990-01-01Paper
Unions of certain bounded deterministic languages1984-01-01Paper
On the equality of grammatical families1983-01-01Paper
A prime decomposition theorem for grammatical families1982-01-01Paper
A pushdown automaton or a context-free grammar - which is more economical?1982-01-01Paper
On reducing the number of states in a PDA1982-01-01Paper
A characterization theorem for certain bounded deterministic context-free languages1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30514021979-01-01Paper
A simplified proof of Parikh's theorem1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32063181977-01-01Paper
Continuous operations on languages1977-01-01Paper
Bounded AFLs1976-01-01Paper
Some uniformly erasable families of languages1976-01-01Paper
Some independent families of one-letter languages1975-01-01Paper
Uniformly erasable AFL1975-01-01Paper
Intersection-closed full AFL and the recursively enumerable languages1973-01-01Paper
Substitution and bounded languages1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331521972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56499861972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56648231971-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jonathan Goldstine