Abstract families of relations
✍ Scribed by Karel Čulík II
- Book ID
- 104148042
- Publisher
- Elsevier Science
- Year
- 1971
- Tongue
- English
- Weight
- 517 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
✦ Synopsis
family of relations (AFR)--is introduced and its special cases are considered. The properties of AFR's and their special cases and their relation to abstract families of languages are studied. Many known formal schemes for description of language translations are shown to define AFRs. As an application of the concept of AFR, it is shown that the class of mappings defined by any finitely encodable abstract family of transducers can be generated from a single language over a 2-letter alphabet by pairs of finite state transductions.
📜 SIMILAR VOLUMES
Any semiorder on a finite set can be reached from any other semiorder on the same set by elementary steps consisting either in the addition or in the removal of a single ordered pair, in such a way that only semiorders are generated at every step, and also that the number of steps equals the distanc
Watanabe, M., Arrow relations on families of finite sets, Discrete Mathematics 94 (1991) 53-64. Let n, m and k be positive integers. Let X be a set of cardinality n, and let 9 be a family of subsets of X. We write (n, m)-, (n -1, mk), when for all 9 with (S( em, there exists an element x of X such t
## By applying a quadratic transformation for the Gauss hypergeometric function, the authors derive a family of generating relations for a general polynomial system. Several interesting consequences of the main result, involving various classes of hypergeometric polynomials, are considered. Furthe