Time complexity of loop-free two-way pushdown automata (Q1838833): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Time and tape complexity of pushdown automaton languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3919065 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improving programs by the introduction of recursion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144216 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two-way nondeterministic pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An effective simulation of deterministic pushdown automata with many two- way and one-way heads / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: General context-free recognition in less than cubic time / rank | |||
Normal rank | |||
Latest revision as of 17:45, 13 June 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
0 references
