Rational transformations and a kleene theorem for power series over rational monoids

Authors:
Ina Fichtner;Christian Mathissen
Affiliations:
Institut für Informatik, Universität Leipzig, Germany;Institut für Informatik, Universität Leipzig, Germany
Venue:
Algebraic Foundations in Computer Science
Year:
2011

Citing 11
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Easy multiplications. I. The realm of Kleene's theorem

Information and Computation
Rational series and their languages

Rational series and their languages
Easy multiplications. II. extensions of rational semigroups

Information and Computation
Effective construction of the synthetic algebra of a recognizable series on trees

Acta Informatica
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
On transformations of formal power series

Information and Computation
Recognizable languages in divisibility monoids

Mathematical Structures in Computer Science
Elements of Automata Theory

Elements of Automata Theory
The myhill-nerode theorem for recognizable tree series

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider transformations on formal power series and extend well-known results in terms of homomorphisms to rational functions. Using these results we prove a Kleene-Schützenberger Theorem for formal power series over rational monoids. It extends a result of Sakarovitch.