On Semilinear Sets over Commutative Semirings

Authors:
Manfred Kudlek
Affiliations:
Fachbereich Informatik, Universität Hamburg Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. E-mail: kudlek@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Year:
2007

Citing 3
Cited 1

Semirings, automata, languages

Semirings, automata, languages
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

On a hierarchy of languages with catenation and shuffle

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of semilinear sets is generalized to commutative semirings. It is shown that the semilinear sets over commutative semirings are exactly the algebraic/rational sets over such structures.