Related Experiment Video
Updated: Mar 22, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
The algebraic characterizations for a formal power series over complete strong bimonoids
1College of Sciences, Southwest Petroleum University, Xindu District, Xindu Road, Chengdu, 610500 China ; College of Mathematics and Econometrics, Hunan University, Yuelu Mountain South Road, Changsha, 410082 China.
Abstract:
On the basis of run semantics and breadth-first algebraic semantics, the algebraic characterizations for a classes of formal power series over complete strong bimonoids are investigated in this paper. As recognizers, weighted pushdown automata with final states (WPDAs for short) and empty stack (WPDAs[Formula: see text]) are shown to be equivalent based on run semantics. Moreover, it is demonstrated that for every WPDA there is an equivalent crisp-simple weighted pushdown automaton with final states by run semantics if the underlying complete strong bimonoid satisfies multiplicatively local finiteness condition. As another type of generators, weighted context-free grammars over complete strong bimonoids are introduced, which are proven to be equivalent to WPDAs[Formula: see text] based on each one of both run semantics and breadth-first algebraic semantics. Finally examples are presented to illuminate the proposed methods and results.
More Related Videos
Related Concept Videos
Sums of Power
Fundamental Theorem of Algebra
Summation Notation
Sequences
Complex Zeros
Indeterminate Products

