The following pages link to (Q3886866):
Displaying 5 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
