Results 1 to 10 of about 157,848 (165)
On the Syntactic Monoids Associated with a Class of Synchronized Codes [PDF]
The Scientific World Journal, 2013 A complete code C over an alphabet A is called synchronized if there exist x,y∈C* such that xA*∩A*y⊆C*. In this paper we describe the syntactic monoid Syn(C+) of C+ for a complete synchronized code C over A such that C+, the semigroup generated by C, is ...
Shou-feng Wang
doaj +10 more sources
A Categorical Approach to Syntactic Monoids [PDF]
Logical Methods in Computer Science, 2018 The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of ...
Jiří Adamek +2 more
doaj +10 more sources
Syntactic Monoids in a Category [PDF]
Conference on Algebra and Coalgebra in Computer Science, 2015 The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D = sets), the syntactic semirings of Polak (D = semilattices), and the syntactic associative ...
Jiřı́ Adámek +2 more
semanticscholar +9 more sources
The Syntactic Monoid of an Infix Code [PDF]
Proceedings of the American Mathematical Society, 1990 Necessary and sufficient conditions on a monoid M M are found in order that M M be isomorphic to the syntactic monoid of a language L L over an alphabet X X having one of the following properties. In the first theorem L L is a P L
Mario Petrich, G. Thierrin
semanticscholar +4 more sources
The syntactic monoid of hairpin-free languages [PDF]
Acta Informatica, 2007 The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is complementary to T and G to C, DNA single strands that are complementary can bind to each other or to ...
Lila Kari +2 more
semanticscholar +4 more sources
The syntactic monoid of the semigroup generated by a maximal prefix code [PDF]
Proceedings of the American Mathematical Society, 1996 Considered are prefix codes which probably represent the class of relatively general codes [\textit{J. Berstel} and \textit{D. Perrin}, Theory of codes, Academic Press, New York (1985; Zbl 0587.68066); \textit{M. Petrich}, Introduction to semigroups, Merrill, Columbus (1973; Zbl 0321.20037)].
Mario Petrich, C. M. Reis, G. Thierrin
semanticscholar +3 more sources
On deterministic finite automata and syntactic monoid size [PDF]
Theoretical Computer Science, 2004 We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of \(n\)-state (minimal) deterministic finite automata. We show tight upper and lower bounds on the syntactic monoid size depending on the number of generators (input alphabet size) used.
Markus Holzer, Barbara König
semanticscholar +5 more sources
Linear splicing and syntactic monoid
Discrete Applied Mathematics, 2005 AbstractSplicing systems were introduced by Head in 1987 as a formal counterpart of a biological mechanism of DNA recombination under the action of restriction and ligase enzymes. Despite the intensive studies on linear splicing systems, some elementary questions about their computational power are still open.
Paola Bonizzoni +3 more
semanticscholar +5 more sources
Groups in the syntactic monoid of a composed code
Journal of Pure and Applied Algebra, 1986 It is proved: Let Y and Z be codes (with Z finite) and let \(X=Y\circ Z\). Then every group in \(M(X^*)\), the syntactic monoid of \(X^*\), divides a generalized wreath product \((G_ 1\times...\times G_ n)\square H\), where \(G_ 1,...,G_ n\) are groups dividing \(M(Y^*)\) and H is a group dividing \(M(Z^*)\).
Pascal Weil
semanticscholar +4 more sources
The syntactic monoid of a hypercode
Semigroup Forum, 1973 This paper gives a characterization of the syntactic monoid of a hypercode H over a finite alphabet X, a hupercode being a non empty set of non empty words over X, which are pairwise incomparable relatively to the embedding partial order of X.
G. Thierrin
semanticscholar +4 more sources