Free polynomial strong bimonoids
From MaRDI portal
Cites work
- Adding involution to residuated structures
- Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
- Complexity of matching problems
- Determinization of weighted finite automata over strong bimonoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- scientific article; zbMATH DE number 4047066 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 51770 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3544224 (Why is no real title available?)
- scientific article; zbMATH DE number 619229 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 3265861 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Nonlinear operators. II
- On finite algebras.
- On the parameterized complexity of associative and commutative unification
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- Rule formats for distributivity
- Semi-substructural logics with additives
- Termination orderings for associative-commutative rewriting systems
- Unification problems with one-sided distributivity
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted finite automata over strong bimonoids
- Über endliche Fastkörper.
This page was built for publication: Free polynomial strong bimonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310709)
