A result on the equivalence problem for deterministic pushdown automata (Q1230509): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of deterministic top-down grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic one-counter automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank | |||
Normal rank |
Revision as of 18:43, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A result on the equivalence problem for deterministic pushdown automata |
scientific article |
Statements
A result on the equivalence problem for deterministic pushdown automata (English)
0 references
1976
0 references