Results 1  10
of
1,853
MyhillNerode Theorem for Sequential Transducers over Unique GCDMonoids
"... Abstract. We generalize the classical MyhillNerode theorem for finite automata to the setting of sequential transducers over unique GCDmonoids, which are cancellative monoids in which every two nonzero elements admit a unique greatest common (left) divisor. We prove that a given formal power serie ..."
Abstract
 Add to MetaCart
) or out of the monoid (IR +, +, 0). A MyhillNerode theorem also allowing minimization is wellknown for sequential transducers over groups [1]. We use (A, ⊙, 1, 0) to denote a monoid with the absorbing element 0. A unique GCDmonoid is a cancellation monoid (A, ⊙, 1, 0) in which (i) a1 implies a = 1
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
Stability structures, motivic DonaldsonThomas invariants and cluster transformations
, 2008
"... ..."
Semigroup Forum OF1–OF14 c © 2004 SpringerVerlag New York, LLC DOI: 10.1007/s002330040119z RESEARCH ARTICLE A Note on Almost GCD Monoids
"... A commutative cancellative monoid H (with 0 adjoined) is called an almost GCD (AGCD) monoid if for x, y in H, there exists a natural number n = n(x, y) so that xn and yn have an LCM, that is, xnH ∩ ynH is principal. We relate AGCD monoids to the recently introduced inside factorial monoids (there is ..."
Abstract
 Add to MetaCart
A commutative cancellative monoid H (with 0 adjoined) is called an almost GCD (AGCD) monoid if for x, y in H, there exists a natural number n = n(x, y) so that xn and yn have an LCM, that is, xnH ∩ ynH is principal. We relate AGCD monoids to the recently introduced inside factorial monoids (there
An introduction to substructural logics
, 2000
"... Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1 ..."
Abstract

Cited by 182 (17 self)
 Add to MetaCart
Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of the TwentyFourth Annual ACM Symposium on Theory of Computing, pages 339369, Victoria, B.C., Canada, May 1992. (225) [207] L. G. Khachian. A polynomial time algorithm for linear programming. Doklady Akademii Nauk SSSR, n.s., 244(5):10931096, 1979. English translation in Soviet Math. Dokl. 20, 191194. (150, 151, 153) [208] S. Khuller. On computing graph closures. Information Processing Letters, 31(5):249255, 12 June 1989. (142, 224) [209] S. Khuller and B. Schieber. E#cient parallel algorithms for testing k connectivity and finding disjoint st paths in graphs. SIAM Journal on Computing, 20(2):352375, April 1991. (134) [210] G. A. P. Kindervater and J. K. Lenstra. An introduction to parallelism in combinatorial optimization. In J. van Leeuwen and J. K. Lenstra, editors, Parallel Computers and Computation, volume 9 of CWI Syllabus, pages 163184. Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1985. (17) [211] G. A. P. Kindervater and J. K. Lenstra. Parallel algorithms. In M. O'hEigeartaigh, J. K. Lenstra, and A. H. G. Rinnooy Kan, editors, Combinatorial Optimization: Annotated Bibliographies, chapter 8, pages 106128. John Wiley & Sons, Chichester, 1985. (17, 21) [212] G. A. P. Kindervater, J. K. Lenstra, and D. B. Shmoys. The parallel complexity of TSP heuristics. Journal of Algorithms, 10(2):249270, June 1989. (138) 272 BIBLIOGRAPHY [213] G. A. P. Kindervater and H. W. J. M. Trienekens. Experiments with parallel algorit...
Gaussian groups and Garside groups, two generalisations of Artin groups
 Proc. London Math. Soc
, 1999
"... Abstract. It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid whe ..."
Abstract

Cited by 148 (31 self)
 Add to MetaCart
Abstract. It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid
ON UNIQUE FACTORIZATION DOMAINS
"... Abstract. In this paper we attempt to generalize the notion of “unique factorization domain ” in the spirit of “halffactorial domain”. It is shown that this new generalization of UFD implies the now well known notion of halffactorial domain. As a consequence, we discover that the one of the stand ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we attempt to generalize the notion of “unique factorization domain ” in the spirit of “halffactorial domain”. It is shown that this new generalization of UFD implies the now well known notion of halffactorial domain. As a consequence, we discover that the one
Results 1  10
of
1,853