Notes on looping deterministic two-way pushdown automata (Q1318758): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q128039952, #quickstatements; #temporary_batch_1722805341585 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Time and tape complexity of pushdown automaton languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-way pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On efficient recognition of transductions and relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remarks on two-way automata with weak-counters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Halting space-bounded computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636862 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707408 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128039952 / rank | |||
Normal rank |
Latest revision as of 22:04, 4 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Notes on looping deterministic two-way pushdown automata |
scientific article |
Statements
Notes on looping deterministic two-way pushdown automata (English)
0 references
5 April 1994
0 references
pushdown automata
0 references