On the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan,...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2008-12-01
|
| Series: | Logical Methods in Computer Science |
| Assuntos: | |
| Acceso en liña: | https://lmcs.episciences.org/1101/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|