Pages that link to "Item:Q1251906"
From MaRDI portal
The following pages link to On equivalence and subclass containment problems for deterministic context-free languages (Q1251906):
Displaying 3 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)