Time complexity of loop-free two-way pushdown automata (Q1838833): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time complexity of loop-free two-way pushdown automata |
scientific article |
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
