Unboundedness and downward closures of higher-order pushdown automata (Q2828251): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unboundedness and downward closures of higher-order pushdown automata |
scientific article |
Statements
Unboundedness and downward closures of higher-order pushdown automata (English)
0 references
24 October 2016
0 references
automata
0 references
concurrency
0 references
downwards closures
0 references
formal languages
0 references
functional programs
0 references
higher-order programs
0 references
model checking
0 references
Parikh images
0 references
pushdown automata
0 references
verification
0 references
