Name
Abstract | ||
|---|---|---|
A language L such that no word in L is a proper factor of another word in L is said to be an infix code. A language L such that no word in L can be obtained from another word in L by the cancellation of a proper factor is called an outfix code. We derive properties of infix and outfix codes which describe their relation to other classes of codes and which determine their combinatorial structures. In particular, we consider closure properties of these and related classes of codes, maximal codes within these classes, the syntactic monoids of such codes, and the connection of these codes with binary relations on the free monoid. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0022-0000(91)90026-2 | JOURNAL OF COMPUTER AND SYSTEM SCIENCES |
Field | DocType | Volume |
Discrete mathematics,Binary relation,Infix,Monoid,Philosophy of language,Free monoid,Syntax,Mathematics | Journal | 43 |
Issue | ISSN | Citations |
3 | 0022-0000 | 24 |
PageRank | References | Authors |
2.48 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Ito | 1 | 45 | 7.18 |
| H. Jürgensen | 2 | 37 | 4.95 |
| H.J. Shyr | 3 | 28 | 3.41 |
| G. Thierrin | 4 | 68 | 10.18 |