A result on the equivalence problem for deterministic pushdown automata (Q1230509): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(76)80049-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030400253 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
A result on the equivalence problem for deterministic pushdown automata
scientific article

    Statements

    Identifiers