Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-09-24
Computer Science
Formal Languages and Automata Theory
Scientific paper
We consider rational power series over an alphabet $\Sigma$ with coefficients
in a ordered commutative semiring $K$ and characterize them as the free ordered
$K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a
star operation satisfying the least pre-fixed point rule and/or its dual. The
results are generalizations of Kozen's axiomatization of regular languages.
Esik Zoltan
Kuich Werner
No associations
LandOfFree
Free inductive K-semialgebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Free inductive K-semialgebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Free inductive K-semialgebras will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-274327