Characterizations of recognizable weighted tree languages by logic and bimorphisms
type: Item
instance of: scholarly article
title: Characterizations of recognizable weighted tree languages by logic and bimorphisms
zbMATH Open document ID: 1398.68308
author: Zoltán Fülöp
author: Heiko Vogler
published in: Soft Computing
publication date: 2018-10-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 6960108
MaRDI profile type: Publication
full work available at URL: s00500-015-1717-2
OpenAlex ID: W862698644
cites work: Weighted grammars and Kleene's theorem
cites work: Recognizable formal power series on trees
cites work: Q5694616
cites work: Tree acceptors and some of their applications
cites work: Automata, Languages and Programming
cites work: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
cites work: Weighted logics for unranked tree automata
cites work: Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
cites work: Weighted tree automata and weighted logics
cites work: Weighted automata and weighted logics
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Weighted Tree Automata and Tree Transducers
cites work: A Büchi-like theorem for weighted tree automata over multioperator monoids
cites work: A Kleene theorem for weighted tree automata over distributive multioperator monoids
cites work: General varieties of tree languages
cites work: Q4498289
cites work: Transductions des langages de Chomsky
cites work: Q4899894
cites work: DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
cites work: A link between multioperator and tree valuation automata and logics
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
DOI: 10.1007/S00500-015-1717-2
Recommended article: Weighted Languages Recognizable by Weighted Tree Automata
Recommended article: Weighted tree automata and weighted logics
Recommended article: Recognizable tree-languages and nonlinear morphisms
Recommended article: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Recommended article: On Recognizable Tree Languages Beyond the Borel Hierarchy
Recommended article: Q4899894
Recommended article: ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
Recommended article: On labeled birooted tree languages: algebras, automata and logic
Recommended article: Weighted Tree Automata and Tree Transducers
Recommended article: Q3515223
description: scientific article; zbMATH DE number 6960108