Note: Schützenberger's theorem on formal power series follows from Kleene's theorem

Authors:
Dietrich Kuske
Affiliations:
Institut für Informatik, Universität Leipzig, Germany
Venue:
Theoretical Computer Science
Year:
2008

Citing 8
Cited 4

Iteration theories: the equational logic of iterative processes

Iteration theories: the equational logic of iterative processes
Automata, Languages, and Machines

Automata, Languages, and Machines
An extension theorem with an application to formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
A Kleene Theorem for Weighted Tree Automata

Theory of Computing Systems
Branching automata with costs: a way of reflecting parallelism in costs

Theoretical Computer Science - Implementation and application of automata
Characterizations of recognizable picture series

Theoretical Computer Science
Skew and infinitary formal power series

Theoretical Computer Science

Weighted and unweighted trace automata

Acta Cybernetica
Valuations of weighted automata: doing it in a rational way

Algebraic Foundations in Computer Science
Construction of fuzzy automata from fuzzy regular expressions

Fuzzy Sets and Systems
Adding pebbles to weighted automata

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

Visualization

Abstract

We derive Schutzenberger's characterisation of the set of recognizable formal power series as a formal corollary from Kleene's characterisation of the set of regular languages.