Мобильная версия

Доступно журналов:

3 288

Доступно статей:

3 891 637

 

Скрыть метаданые

Автор JÜrgensen, H.
Автор Yu, S.S.
Дата выпуска 1991
dc.description Many classes of codes can be characterized as families of antichains with respect to partial orders on the free monoid or, in more general terms, as families of independent sets with respect to some binary relations. In this paper we investigate the general properties of this connection between families of sets and binary relations. This theory provides a framework in which known results about codes can be expressed elegantly and in which several new results are derived. Moreover, this theory can be generalized to relations of arbitrary finite arity in a very natural fashion. This allows us, for instance, to prove new hierarchy results. More importantly, however, this theory provides a new and profound insight into the mechanisms by which classes of codes are defined.
Формат application.pdf
Издатель Gordon and Breach Science Publishers
Копирайт Copyright Taylor and Francis Group, LLC
Тема Code
Тема relation
Тема combinatorics of words
Тема E.4
Тема F.4.3
Название Relations on free monoids, their independent sets, and codes
Тип research-article
DOI 10.1080/00207169108803999
Electronic ISSN 1029-0265
Print ISSN 0020-7160
Журнал International Journal of Computer Mathematics
Том 40
Первая страница 17
Последняя страница 46
Аффилиация JÜrgensen, H.; Department of Computer Science, The University of Western Ontario
Аффилиация Yu, S.S.; Department of Computer Science, The University of Western Ontario
Выпуск 1-2
Библиографическая ссылка Day, P.H. and Shyr, H.J. 1983. Languages defined by Some Partial Orders. Soochow J. Math, 9: 53–62.
Библиографическая ссылка Haines, L.H. 1969. On Free Monoids Partially Ordered by Embedding. J. Combinatorial Theory, 6: 94–98.
Библиографическая ссылка Higman, G. 1952. Ordering by Divisibility in Abstract Algebras. Proc. London Math. Soc, 3: 326–336.
Библиографическая ссылка Ito, M., Jürgensen, H., Shyr, H.J. and Thierrin, G. 1989. Anti-Commutative Languages and n-Codes. Discrete Applied Math, 24: 187–196.
Библиографическая ссылка Ito, M., Jürgensen, H., Shyr, H.J. and Thierrin, G. 1989. n-Prefix-Sufrix Languages. Internat.J. Comp. Math, 30: 37–56.
Библиографическая ссылка Jullien, M.P. 1968. Sur un Théorème d'extension dans la théorie des mots, Vol. A266, 651–654. Paris: C. R. Acad. Sci.
Библиографическая ссылка Jürgensen, H., Shyr, H.J. and Thierrin, G. Codes and Compatible Partial Orders. Algebra and Order, Proc.1st International Sympos. on Ordered Algebraic Structures,Luminy-Marseilles. 1984. pp.323–333. Berlin: Heldermann-Verlag.
Библиографическая ссылка Jürgensen, H. and Yu, S.S. 1990. Solid Codes. E1K, 26: 563–574.
Библиографическая ссылка Jürgensen, H. and Thierrin, G. Infix Codes. Topics in the Theoretical Bases and Applications of Computer and Science. Proc. 4th Hungarian Comp. Sci. Conf, Gyor. 1985. Edited by: Arató, M., Kátai, L. and Varga, L. pp.25–29. Budapest: Akademiai Kiado.
Библиографическая ссылка Petrich, M. and Thierrin, G. 1986. The Syntactic Monoid of an Infix Code. Proc. Amer. Math. Soc, to appear
Библиографическая ссылка Shyr, H.J. 1979. Free Monoids and Languages. Lecture Notes, Taipei: Soochow University. Department of Mathematics
Библиографическая ссылка Shyr, H.J. and Thierrin, G. 1977. “Codes and Binary Relations”. In Seminaire d'Algébre Paul Dubreil, Edited by: Malliavin, M.P. Vol. 586, 180–188. Berlin: Springer-Verlag. Paris 1975-1976, (29 ème Année). Edited by.~Lecture Notes in Mathematics
Библиографическая ссылка Shyr, H.J. and Thierrin, G. 1974. Hypercodes. Information and Control, 24: 45–54.
Библиографическая ссылка Shyr, H.J. and Yu, S.S. 1990. Intercodes and Some Related Properties. Soochow J. of Math, 16: 95–107.
Библиографическая ссылка Thierrin, G. 1973. The Syntactic Monoid of a Hypercode. Semigroup Forum, 6: 227–231.
Библиографическая ссылка Thierrin, G. and Yu, S.S. Shuffle Relations and Codes, Submitted for publication.
Библиографическая ссылка Valkema, E. 1976/77. Syntakische Monoide und Hypercodes. Semigroup Forum, 13: 119–126.
Библиографическая ссылка Yu, S.S. 1990. Codes and n-ary Relations, The University of Western Ontario. Ph. D. Thesis
Библиографическая ссылка Yu, S.S. 1990. A Characterization of Intercodes. Internat. J. Comp. Math, 36: 39–45.

Скрыть метаданые