On the computational power of pushdown automata (Q2542990): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-way pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time and tape complexity of pushdown automaton languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636862 / rank | |||
Normal rank |
Latest revision as of 02:31, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational power of pushdown automata |
scientific article |
Statements
On the computational power of pushdown automata (English)
0 references
1970
0 references