Weighted finite automata over strong bimonoids
From MaRDI portal
Publication:845343
Recommendations
- Determinization of weighted finite automata over strong bimonoids
- The relationships among several forms of weighted finite automata over strong bimonoids
- scientific article; zbMATH DE number 6124028
- Congruence and minimization of deterministic weighted finite automata
- scientific article; zbMATH DE number 6719345
Cites work
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- A note on cut-worthiness of recognizable tree series
- Applications of weighted automata in natural language processing
- Approximation and robustness of fuzzy finite automata
- Cut sets as recognizable tree languages
- Determinism and fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Digital image compression
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Handbook of weighted automata
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 177548 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 3623470 (Why is no real title available?)
- scientific article; zbMATH DE number 3265861 (Why is no real title available?)
- Minimization algorithms for sequential transducers
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- On the definition of a family of automata
- On the determinization of weighted finite automata
- The design principles of a weighted finite-state transducer library
- Weighted automata and weighted logics
Cited in
(45)- Local finiteness in t-norm bimonoids: overlap cases
- Construction of fuzzy automata from fuzzy regular expressions
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Conditions for the existence of maximal factorizations
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- McCarthy-Kleene fuzzy automata and MSO logics
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Approximated determinisation of weighted tree automata
- Sequentiality of group-weighted tree automata
- Weighted automata with storage
- The relationships among several forms of weighted finite automata over strong bimonoids
- The complexity of computing the behaviour of lattice automata on infinite trees
- Bisimulation relations for weighted automata
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- On quotients of formal power series
- The supports of weighted unranked tree automata
- Weighted symbolic automata with data storage
- Congruence and minimization of deterministic weighted finite automata
- Determinations of weighted finite automata over commutative idempotent MF-semirings
- Weighted nested word automata and logics over strong bimonoids
- scientific article; zbMATH DE number 6719345 (Why is no real title available?)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Valuations of weighted automata: doing it in a rational way
- MK-fuzzy automata and MSO logics
- Bisimulations for fuzzy automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- scientific article; zbMATH DE number 6124028 (Why is no real title available?)
- Crisp-determinization of weighted tree automata over strong bimonoids
- Weighted context-free grammars over bimonoids
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- An improved algorithm for determinization of weighted and fuzzy automata
- Weighted tree generating regular systems over strong bimonoids with reduction semantics
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
- Bideterministic weighted automata
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Weighted Linear Dynamic Logic
- Weighted automata and logics meet computational complexity
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Nondeterministic fuzzy automata
- Free polynomial strong bimonoids
- On union of regular near-rings
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Equational weighted tree transformations
- Model checking computation tree logic over finite lattices
- Determinization of weighted finite automata over strong bimonoids
This page was built for publication: Weighted finite automata over strong bimonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845343)
