Linearity is polynomially decidable for realtime pushdown store automata (Q3048299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linearity is polynomially decidable for realtime pushdown store automata |
scientific article; zbMATH DE number 3642750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linearity is polynomially decidable for realtime pushdown store automata |
scientific article; zbMATH DE number 3642750 |
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
