Linearity is polynomially decidable for realtime pushdown store automata (Q3048299)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearity is polynomially decidable for realtime pushdown store automata |
scientific article |
Statements
Linearity is polynomially decidable for realtime pushdown store automata (English)
0 references
1979
0 references
real-time pushdown store automata
0 references
linear context free languages
0 references
acceptance
0 references
polynomial decidability
0 references
