Two decidability results for deterministic pushdown automata (Q1254241): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Matti Linna / rank
Normal rank
 
Property / author
 
Property / author: Matti Linna / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(79)90055-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041168146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal translations and Szilard languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associate languages and derivational complexity of formal grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On derivation languages corresponding to context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the equivalence problem for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:24, 13 June 2024

scientific article
Language Label Description Also known as
English
Two decidability results for deterministic pushdown automata
scientific article

    Statements

    Two decidability results for deterministic pushdown automata (English)
    0 references
    1979
    0 references
    Decidability
    0 references
    Deterministic Pushdown Automata
    0 references
    Equivalence Problem
    0 references
    Stack Uniform Automata
    0 references
    Inclusion Problem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references