Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
447--452
Opis fizyczny
bibliogr. 10 poz.
Twórcy
autor
- Universität Hamburg Fachbereich Informatik Vogt-Kölln-Str. 30 D-22527 Hamburg, Germany, kudlek@informatik.uni-hamburg.de
Bibliografia
- [1] J. Berstel : Transductions and Context-free Languages. Teubner, 1979.
- [2] S. Eilenberg, M. P. Schützenberger : Rational sets in Commutative Monoids. Journ. of Algebra 13, pp 173-191, 1969.
- [3] S. Ginsburg : The Mathematical Theory of Context-free Languages. McGraw Hill, 1966.
- [4] M. Jantzen : IntersectingMultisets and Applications to Macrosets. Fachbereich Informatik, Universität Hamburg,, Bericht 247, 2003.
- [5] M. Kudlek : Rational, Linear and Algebraic Languages of Multisets. Pre-Proceedings of the Workshop on Multiset Processing ( WMP'2000 ), ed. C. S. Calude, M. J. Dinneen, G. Pǎun, CDMTCS-140, pp 138-148, 2000.
- [6] M. Kudlek, C. Martín Vide, Gh. Pǎun: Toward FMT ( Formal Macroset Theory ). Pre-Proceedings of the Workshop on Multiset Processing ( WMP'2000 ), ed. C. S. Calude, M. J. Dinneen, G. Pǎun, CDMTCS-140, pp 149-158, 2000.
- [7] W. Kuich, A. Salomaa : Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science 5, Springer, Berlin, 1986.
- [8] O. Kummer : Referenznetze. Logos-Verlag, 2002.
- [9] J. Mezei, J. B. Wright : Algebraic Automata and Context-free Sets. IC 11, pp 3-29, 1967.
- [10] Gh. Pǎun: Computing with Membranes. An Introduction. Bulletin of EATCS 67, pp 139-152, 1999.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS5-0010-0072