Finite tree automata with cost functions
type: Item
instance of: scholarly article
title: Finite tree automata with cost functions
zbMATH Open document ID: 0805.68085
DOI: 10.1016/0304-3975(94)90271-2
author: Helmut Seidl
published in: Theoretical Computer Science
publication date: 1994-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 16Y60
zbMATH DE Number: 567729
zbMATH Keywords: finite tree automata
zbMATH Keywords: cost automaton
zbMATH Keywords: arctical semiring
zbMATH Keywords: semiring of nonnegative integers
zbMATH Keywords: tropical semiring
zbMATH Keywords: semiring of finite subsets of nonnegative integers
zbMATH Keywords: decidability of boundedness
zbMATH Keywords: cost functions
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90271-2
OpenAlex ID: W2118117473
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Q4179852
cites work: Q4711083
cites work: Q3315030
cites work: Q4160409
cites work: On the finite degree of ambiguity of finite tree automata
cites work: Single-valuedness of tree transducers is decidable in polynomial time
cites work: Q4273672
cites work: Q3484344
Recommended article: Automata on finite trees
Recommended article: Q3746905
Recommended article: Q5418248
Recommended article: Q3323279
Recommended article: Q4004425
Recommended article: On the Determinization of Weighted Finite Automata
Recommended article: Q4662841
Recommended article: Bottom-Up Tree Automata with Term Constraints
Recommended article: A Congruence-Based Perspective on Finite Tree Automata
Recommended article: On a representation of tree automata
description: scientific article; zbMATH DE number 567729