The following pages link to Emily P. Friedman (Q1235013):
Displaying 10 items.
- (Q1132641) (redirect page) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- The inclusion problem for simple languages (Q1235014) (← links)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- A note on non-singular deterministic pushdown automata (Q1252037) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- Superdeterministic PDAs (Q3912024) (← links)
- A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors (Q3962488) (← links)
- Simple context-free languages and free monadic recursion schemes (Q4139703) (← links)