Pushing for Weighted Tree Automata (Q3088063): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3130543
 
description / endescription / en
 
scientific article; zbMATH DE number 6828648
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1390.68394 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.23638/LMCS-14(1:5)2018 / rank
 
Normal rank
Property / author
 
Property / author: Thomas Hanneforth / rank
 
Normal rank
Property / publication date
 
23 January 2018
Timestamp+2018-01-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 January 2018 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6828648 / rank
 
Normal rank
Property / zbMATH Keywords
 
weighted tree automaton
Property / zbMATH Keywords: weighted tree automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
pushing
Property / zbMATH Keywords: pushing / rank
 
Normal rank
Property / zbMATH Keywords
 
minimization
Property / zbMATH Keywords: minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
equivalence testing
Property / zbMATH Keywords: equivalence testing / rank
 
Normal rank

Latest revision as of 10:12, 6 May 2024

scientific article; zbMATH DE number 6828648
Language Label Description Also known as
English
Pushing for Weighted Tree Automata
scientific article; zbMATH DE number 6828648

    Statements

    Pushing for Weighted Tree Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    23 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weighted tree automaton
    0 references
    pushing
    0 references
    minimization
    0 references
    equivalence testing
    0 references