Results 101 to 110 of about 157,848 (165)
SYNTACTIC MONOIDS AND LANGUAGES (Algebra, Languages and Computation)
SYNTACTIC MONOIDS AND LANGUAGES (Algebra, Languages and Computation)openaire
自由単位半群のbiunitary submonoidのsyntactic monoidについて(2)
自由単位半群のbiunitary submonoidのsyntactic monoidについて(2)openaire
WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
International Journal of Foundations of Computer Science, 2008 DNA strands that, mathematically 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 Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways.
Lila Kari, Kalpana Mahalingam
semanticscholar +4 more sources
A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ
Order, 2018 Let Λ∗ be the free monoid of (finite) words over a not necessarily finite alphabet Λ, which is equipped with some (partial) order. This ordering lifts to Λ∗, where it extends the divisibility ordering of words. The MacNeille completion of Λ∗ constitutes a complete lattice ordered monoid and is realized by the system of “closed” lower sets in Λ ...
Hans‐Jürgen Bandelt, Maurice Pouzet
semanticscholar +6 more sources
A finite inverse biprefix code whose syntactic monoid has n D-classes
, 2002 In 1956, M.P. Schüzenberger proved that cyclic groups are the only groups which can appear as syntactic monoids of finite prefix codes. Later in 1985, P. Udomkavanich gave an algorithm to construct all finite prefix codes whose syntactic monoids are inverse semigroups.
Pairot Noumnom
semanticscholar +3 more sources
Subgroups of syntactic monoids of finite inverse biprifix codes
, 2000 Finite biprefix codes whose syntactic monoids are groups were studied by M.P. Schutzenberger. P. Udomkavanich gave a characterization of finite inverse biprefix codes (codes admitting finite inverse semigroups as their syntactic monoids). An example of finite inverse biprefix code whose syntactic monoid contains a nonabelian group, S3, was given.
Khajee Jantarakhajorn
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On?-Languages whose syntactic monoid is trivial
International Journal of Computer & Information Sciences, 1983Während für Sprachen im üblichen Sinne das syntaktische Monoid genau dann trivial ist, wenn die Sprache selbst trivial ist, findet man unter den \(\omega\)-Sprachen zahlreiche nicht-triviale Beispiele mit trivialem syntaktichen Monoid. In der vorliegenden Arbeit werden einige Charakterisierungssätze zu dieser Situation bewiesen.
Gabriel Thierrin, Helmut Jürgensen
openaire +4 more sources
The syntactic monoid of the semigroup generated by a comma-free code
Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 1995A sequence of lemmas leads to a two-fold characterisation of the syntactic monoid in the title. Some alternatives as well as special cases, in particular when the code consists of a singleton, are considered.
C. M. Reis, Mario Petrich
openaire +3 more sources
Syntactic Nondeterministic Monoids
Journal of Discrete Mathematical Sciences and Cryptography, 2015AbstractWe construct the syntactic nondeterministic monoid associated with a subset L of a nondeterministic monoid M. It is the quotient of M by the greatest nondeterministic congruence∼L on M saturating L and is characterized by the classical universal property.
Olympia Louscou-Bozapalidou +1 more
openaire +3 more sources
Which finite monoids are syntactic monoids of rational ω-languages
Information Processing Letters, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Phan Trung Huy +2 more
openalex +2 more sources