Scope-Bounded Pushdown Languages
We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We show that scoped Mpa are indeed a robust model of computation, by focusing...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2016-02-01.
|
| Subjects: | |
| Online Access: | Get fulltext |