Pages that link to "Item:Q4141220"
From MaRDI portal
The following pages link to On jump-deterministic pushdown automata (Q4141220):
Displaying 11 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- Deep pushdown automata (Q2491213) (← links)
- Pushdown tree automata (Q3036724) (← links)
