A unifying Kleene theorem for weighted finite automata

Authors:
Zoltán Ésik;Werner Kuich
Affiliations:
Dept. of Computer Science, University of Szeged, Hungary;Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Austria
Venue:
Rainbow of computer science
Year:
2011

Citing 11
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Formal languages

Formal languages
The Kleene and the Parikh theorem in complete semirings

14th International Colloquium on Automata, languages and programming
Rational series and their languages

Rational series and their languages
Semirings and formal power series: their relevance to formal languages and automata

Handbook of formal languages, vol. 1
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Inductive *-semirings

Theoretical Computer Science - Words, languages and combinatorics
Partial Conway and Iteration Semirings

Fundamenta Informaticae
Handbook of Weighted Automata

Handbook of Weighted Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We state two variants of the Theorem of Kleene-Schützenberger: one for arbitrary semirings and proper finite automata; the other for Conway semirings and arbitrary finite automata. Considering finite automata over partial Conway semirings over an ideal, we show that these two variants are special cases of a unifying theorem.