The following pages link to Amiram Yehudai (Q598820):
Displaying 18 items.
- A note on the pumping lemma for regular languages (Q598821) (← links)
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
- On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
- A note on chains of deterministic pushdown transducers (Q1062768) (← links)
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- (Q3326867) (← links)
- An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA (Q3719834) (← links)
- An Iteration Theorem for Simple Precedence Languages (Q3765258) (← links)
- Eliminating null rules in linear time (Q3906449) (← links)
- (Q3923602) (← links)
- The decidability of equivalence for a family of linear grammars (Q3923621) (← links)
- (Q3948610) (← links)
- A new definition for simple precedence grammars (Q4188771) (← links)
- (Q4499180) (← links)
