scientific article; zbMATH DE number 2040322
From MaRDI portal
Publication:4449537
zbMATH Open1089.68054MaRDI QIDQ4449537FDOQ4449537
Authors: Zoltán Ésik, W. Kuich 
Publication date: 11 February 2004
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 708666
- scientific article; zbMATH DE number 1354999
- The rank of a formal tree power series
- Tree-level formalism
- Hierarchies of tree series transformations
- Finitely presentable tree series
- Context-free series on trees
- Compositions of tree series transformations
- scientific article; zbMATH DE number 2040320
- Varieties of formal series on trees and Eilenberg's theorem
Cited In (46)
- Weighted tree automata and weighted logics
- Title not available (Why is that?)
- Equational weighted tree transformations with discounting
- A coinductive calculus of binary trees
- Characterization of tree automata based on quantum logic
- A note on cut-worthiness of recognizable tree series
- Title not available (Why is that?)
- Learning Rational Stochastic Tree Languages
- Definable transductions and weighted logics for texts
- Crisp-determinization of weighted tree automata over strong bimonoids
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Survey: Weighted extended top-down tree transducers. III. Composition
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Forty years of formal power series in automata theory
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Kleene theorem in partial Conway theories with applications
- Continuous monoids and semirings
- Weighted tree automata with constraints
- Finite sequentiality of finitely ambiguous max-plus tree automata
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Fuzzy tree automata
- Cut sets as recognizable tree languages
- Context-free series on trees
- Weighted tree automata with constraints
- State hyperstructures of tree automata based on lattice-valued logic
- Finite sequentiality of unambiguous max-plus tree automata
- Formal series over sorted algebras
- Trees and B-series
- Varieties of recognizable tree series over fields
- Equational weighted tree transformations
- Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
- A Kleene theorem for weighted tree automata over tree valuation monoids
- Rational weighted tree languages with storage
- A Mezei-Wright theorem for categorical algebras
- Approximate minimization of weighted tree automata
- Principal abstract families of weighted tree languages
- On transductions of formal power series over complete semirings
- Représentations matricielles des séries d'arbre reconnaissables
- Title not available (Why is that?)
- Formal series of general algebras over a field and their syntactic algebras
- Weighted monadic Datalog
- Finitely presentable tree series
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Algebraic systems and pushdown automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449537)
