A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices

DOI10.1142/s0129054123480039OpenAlexW4384525352MaRDI QIDQ6154974

Heiko Vogler, Zoltán Fülöp

Publication date: 16 February 2024

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123480039

zbMATH Keywords

inclusion relationsbounded latticesweighted tree automatainitial algebra semanticsrun semantics

Mathematics Subject Classification ID

Theory of computing (68Qxx) General logic (03Bxx) Computer science (68-XX)

Cites Work

• Weighted automata and multi-valued logics over arbitrary bounded lattices
• The free lattice generated by a set of chains
• Handbook of weighted automata
• Weighted finite automata over strong bimonoids
• Weighted tree automata and weighted logics
• Determinization of weighted finite automata over strong bimonoids
• Weighted grammars and Kleene's theorem
• Recognizable formal power series on trees
• Characterizations of complete residuated lattice-valued finite tree automata
• Determinism and fuzzy automata
• Weighted automata
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• Fuzzy tree language recognizability
• Fuzzy tree automata
• Tree acceptors and some of their applications
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• On the definition of a family of automata
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Bottom-up and top-down tree transformations— a comparison
• Initial Algebra Semantics and Continuous Algebras
• Term Rewriting and All That
• Crisp-determinization of weighted tree automata over strong bimonoids
• Weighted Tree Automata and Tree Transducers
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Maximin automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices