73 citations · 300 across the 27 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2025
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
Filip Mazowiecki, Antoni Puch, Daniel Smertnig
In this work we consider two rich subclasses of weighted automata over fields: polynomially ambiguous weighted automata and copyless cost register automata. Primarily we are intere…
cs.FL2023★ 1 cited
Duality of Lattices Associated to Left and Right Quotients
Jason Bell, Daniel Smertnig, Hellis Tamm
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we pro…
cs.FL2022★ 6 cited
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
Jason P. Bell, Daniel Smertnig
The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the aut…