Pages that link to "Item:Q1235014"
From MaRDI portal
The following pages link to The inclusion problem for simple languages (Q1235014):
Displayed 15 items.
- Decision problems for pushdown threads (Q884992) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- (Q3922198) (← links)
- (Q3956423) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)