The following pages link to Jonathan Goldstine (Q584930):
Displaying 26 items.
- A prime decomposition theorem for grammatical families (Q584932) (← links)
- On the equality of grammatical families (Q791327) (← links)
- On measuring nondeterminism in regular languages (Q912641) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- On the relation between ambiguity and nondeterminism in finite automata (Q1198953) (← links)
- Some independent families of one-letter languages (Q1217463) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Bounded AFLs (Q1227455) (← links)
- Some uniformly erasable families of languages (Q1232299) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- Measuring nondeterminism in pushdown automata (Q2575832) (← links)
- (Q3051402) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- (Q3150253) (← links)
- (Q3206318) (← links)
- Unions of certain bounded deterministic languages (Q3339315) (← links)
- A characterization theorem for certain bounded deterministic context-free languages (Q3907109) (← links)
- On reducing the number of states in a PDA (Q3948599) (← links)
- (Q4133152) (← links)
- Continuous operations on languages (Q4139699) (← links)
- Measuring nondeterminism in pushdown automata (Q5048932) (← links)
- (Q5422234) (← links)
- (Q5649986) (← links)
- (Q5664823) (← links)
- Intersection-closed full AFL and the recursively enumerable languages (Q5684250) (← links)
