Iterated relabeling tree transducers (Q1605311): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of two theorems about rational transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / 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: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transductions des langages de Chomsky / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings and grammars on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les rélations rationnelles entre monoides libres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequential machine maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first-order theory of one-step rewriting is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated a-NGSM maps and Γ systems / rank
 
Normal rank

Latest revision as of 11:54, 4 June 2024

scientific article
Language Label Description Also known as
English
Iterated relabeling tree transducers
scientific article

    Statements

    Iterated relabeling tree transducers (English)
    0 references
    15 July 2002
    0 references
    0 references
    term rewriting
    0 references
    tree automata
    0 references
    finite state relabeling
    0 references
    composition
    0 references
    0 references
    0 references