Pages that link to "Item:Q1158965"
From MaRDI portal
The following pages link to DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965):
Displaying 10 items.
- On second-order iterative monads (Q639639) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Tree pushdown automata (Q1058866) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA (Q2856007) (← links)
- Pushdown tree automata (Q3036724) (← links)
