On equivalence of grammars through transformation trees (Q1259173): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms of deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Strict Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parsing of Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence and containment problems for context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability results for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for checking equivalence of LL(k) 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: Q4085271 / 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: 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
Property / cites work
 
Property / cites work: Some remarks on the KH algorithm fors-grammars / rank
 
Normal rank

Latest revision as of 02:36, 13 June 2024

scientific article
Language Label Description Also known as
English
On equivalence of grammars through transformation trees
scientific article

    Statements

    On equivalence of grammars through transformation trees (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    Strict Deterministic Grammars
    0 references
    Transformation Trees
    0 references
    Equivalence
    0 references
    Problem for Deterministic Context-Free Languages
    0 references
    Grammar Oriented Decision Procedure
    0 references
    0 references