scientific article; zbMATH DE number 2040322

From MaRDI portal
Revision as of 04:27, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4449537

zbMath1089.68054MaRDI QIDQ4449537

Zoltán Ésik, Werner Kuich

Publication date: 11 February 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (33)

Crisp-determinization of weighted tree automata over strong bimonoidsA note on cut-worthiness of recognizable tree seriesFuzzy tree automataFinite-image property of weighted tree automata over past-finite monotonic strong bimonoidsDefinable transductions and weighted logics for textsState hyperstructures of tree automata based on lattice-valued logicWeighted tree automata and weighted logicsWeighted tree automata with constraintsContinuous monoids and semiringsVarieties of recognizable tree series over fieldsA Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded LatticesLearning Rational Stochastic Tree LanguagesSchützenberger's theorem on formal power series follows from Kleene's theoremWeighted monadic DatalogA Büchi-like theorem for weighted tree automata over multioperator monoidsA coinductive calculus of binary treesMulti-Linear Iterative K-Σ-SemialgebrasHasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformationsCut sets as recognizable tree languagesA Kleene theorem for weighted tree automata over distributive multioperator monoidsWeighted tree automata with constraintsA Kleene theorem for weighted tree automata over tree valuation monoidsFinite sequentiality of unambiguous max-plus tree automataApproximate minimization of weighted tree automataPrincipal abstract families of weighted tree languagesWeighted Tree Automata over Valuation Monoids and Their Characterization by Weighted LogicsKleene Theorem in Partial Conway Theories with ApplicationsEquational Weighted Tree Transformations with DiscountingAlgebraic Systems and Pushdown AutomataSurvey: Weighted Extended Top-Down Tree Transducers Part III — CompositionEquational weighted tree transformationsA Mezei-Wright theorem for categorical algebrasCharacterization of tree automata based on quantum logic






This page was built for publication: