Jonathan Goldstine

Available identifiers

zbMath Open goldstine.jonathanMaRDI QIDQ584930

List of research outcomes

Publication	Date of Publication	Type
Measuring nondeterminism in pushdown automata	2022-11-09	Paper
Descriptional complexity of machines with limited resources	2007-10-17	Paper
Measuring nondeterminism in pushdown automata	2005-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q3150253	2002-09-30	Paper
On reducing the number of stack symbols in a PDA	1994-08-21	Paper
On the relation between ambiguity and nondeterminism in finite automata	1993-01-16	Paper
On measuring nondeterminism in regular languages	1990-01-01	Paper
Unions of certain bounded deterministic languages	1984-01-01	Paper
On the equality of grammatical families	1983-01-01	Paper
A prime decomposition theorem for grammatical families	1982-01-01	Paper
A pushdown automaton or a context-free grammar - which is more economical?	1982-01-01	Paper
On reducing the number of states in a PDA	1982-01-01	Paper
A characterization theorem for certain bounded deterministic context-free languages	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3051402	1979-01-01	Paper
A simplified proof of Parikh's theorem	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3206318	1977-01-01	Paper
Continuous operations on languages	1977-01-01	Paper
Some uniformly erasable families of languages	1976-01-01	Paper
Bounded AFLs	1976-01-01	Paper
Uniformly erasable AFL	1975-01-01	Paper
Some independent families of one-letter languages	1975-01-01	Paper
Intersection-closed full AFL and the recursively enumerable languages	1973-01-01	Paper
Substitution and bounded languages	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4133152	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5649986	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5664823	1971-01-01	Paper

Research outcomes over time

This page was built for person: Jonathan Goldstine