Powiadomienia systemowe
- Sesja wygasła!
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
We prove that the family of retracts of a free monoid generated by three elements, partially ordered with respect to the inclusion, is a complete lattice.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
123--127
Opis fizyczny
Bibliogr. 7 poz.
Twórcy
autor
- PWSZ Nowy Sącz, Institute of Economics, uL Jagiellońska 61, 33-300 Nowy Sącz, Poland, forysw@ii.uj.edu.pl
Bibliografia
- [1] J.A. Anderson, Semiretracts of a free monoid, Theoretical Computer Science, 134, 1994.
- [2] J.A. Anderson, The intersection of retracts of A*, Theoretical Computer Science, 237, 2000.
- [3] J.A. Anderson, W. Foryś, Regular languages and semiretracts, Proccedings of Conference “Words, Languages and Combinatorics”, Kyoto, 2000.
- [4] J.A. Anderson, W. Foryś, T. Head, Retracts and semiretracts of free monoids, AMS Meeting (Proccedings), San Francisco, 1991.
- [5] W. Foryś, T. Head, The poset of retracts of a free monoid, Intern. J. Computer Math., 37, 1990.
- [6] T. Head, Expanded subalphabets in the theories of languages and semigroups, Intern. J. Computer Math., 12, 1982.
- [7] A. Tarski, A lattice-theoretic fixpoint theorem and its applications, Pacific J. Math., 5, 1955.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-AGHB-0001-0002