1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.RA2025
Free polynomial strong bimonoids
Manfred Droste, Zoltán Fülöp
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semi…
cs.FL2025
Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
Zoltán Fülöp, Heiko Vogler
Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality…