Time complexity of loop-free two-way pushdown automata (Q1838833)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3806959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time complexity of loop-free two-way pushdown automata |
scientific article; zbMATH DE number 3806959 |
Statements
Time complexity of loop-free two-way pushdown automata (English)
0 references
1983
0 references
simulation
0 references
time complexity
0 references
algorithm for the fast recognition of languages recognized by two-way nondeterministic pushdown automata
0 references
0 references
