Acta Cybernetica · 2011 · 19 citations · 3 references
Natural SciencesComputer ScienceMathematicsAlgebraRepresentation TheorySet TheoryAbstract AlgebraAutomata TheoryCommutative AlgebraFinite AutomataFinite Automata TheoryWeighted AutomataWeighted Finite-state Automata
We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.
3
Transductions and Context-Free Languages
Jean Berstel · 1979 · 1.3K citations
On rational series and rational languages
Huaxiong Wang · Theoretical Computer Science · 1998 · 27 citations