The following pages link to Visibly pushdown languages (Q3580970):
Displaying 6 items.
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem (Q6548960) (← links)
- On the decidability of infix inclusion problem (Q6580072) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)
- Separating the expressive power of propositional dynamic and modal fixpoint logics (Q6643745) (← links)