An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q248922
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bruno Courcelle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite trees in normal form and recursive equations having a unique solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for attribute systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for the equivalence of recursive schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for mappings on infinite strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system which automatically improves programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up and top-down tree transformations— a comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down tree transducers with regular look-ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence of grammars through transformation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving and applying program transformations expressed with second-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / 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: Tree-Manipulating Systems and Church-Rosser Theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:00, 17 June 2024

scientific article
Language Label Description Also known as
English
An axiomatic approach to the Korenjak-Hopcroft algorithms
scientific article

    Statements

    An axiomatic approach to the Korenjak-Hopcroft algorithms (English)
    0 references
    1983
    0 references
    axiomatic approach to algorithms
    0 references
    equivalence decision algorithms
    0 references
    grammars
    0 references
    program schemes
    0 references
    transducers
    0 references
    deterministic top-down tree transductions of infinite trees
    0 references
    0 references

    Identifiers

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