Abstract: In the parameterized string matching, a given pattern P is said to match with a substring t of the text T, if there exist a bijection from the symbols of P to the symbols of t. This problem ...

Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...