Automata and languages generalized to \(\omega\)-continuous semirings (Q2640344)

After presenting some basic notions and results about \(\omega\)-finitary semirings, one defines automata over \(\omega\)-continuous semirings and a generalization of the Kleene Theorem to this case is proved. (The result has been reported in \textit{W. Kuich} [Lect. Notes Comput. Sci. 267, 212- 225 (1987; Zbl 0625.16026)], the Kleene and the Parikh Theorems in complete semirings. Algebraic systems in the polynomial algebra over an \(\omega\)-continuous semiring and pushdown automata over \(\omega\)-continuous semirings are defined and shown to be equivalent, thus generalizing a known characterization of context-free languages.