Results 21 to 30 of about 157,848 (165)
Acta Cybernetica, 1999 Summary: A general characterization theorem for syntactic monoids of codes that satisfy independence conditions of a special form is proved. This result provides insight in some known characterizations of classes of codes via syntactic monoids and provides a general mechanism for deriving new characterizations for other classes of languages.
Helmut Jürgensen
openalex +4 more sources
, 2017 Let $ ^{\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $ $, which is equipped with some (partial) order. This ordering lifts to $ ^{\ast}$, where it extends the divisibility ordering of words. The MacNeille completion of $ ^{\ast}$ constitutes a complete lattice ordered monoid and is realized by the system of ...
Hans‐Jürgen Bandelt, Maurice Pouzet
+6 more sources
On certain codes admitting inverse semigroups as syntactic monoids
Semigroup Forum, 1974 The purpose of this paper is to investigate under what conditions an inverse semigroup M is isomorphic to the syntactic monoid M(A)* of afinite prefix code A over an alphabet X. We find a necessary condition for this to happen. It expresses a precise link between the group of units of M and the maximal subgroups of the 0-minimal ideal of M (Theorem 2.1)
Michael A. Keenan, G. Lallement
openalex +3 more sources
String Grammar Unsupervised Possibilistic Fuzzy C-Medians for Gait Pattern Classification in Patients with Neurodegenerative Diseases. [PDF]
Comput Intell Neurosci, 2018 Neurodegenerative diseases that affect serious gait abnormalities include Parkinson′s disease (PD), amyotrophic lateral sclerosis (ALS), and Huntington disease (HD). These diseases lead to gait rhythm distortion that can be determined by stride time interval of footfall contact times.
Klomsae A +2 more
europepmc +2 more sources
Regular semigroups with D = R as syntactic monoids of prefix codes
Theoretical Computer Science, 1976 G. Lallement
openalex +3 more sources
On DR Tree Automata, Unary Algebras and Syntactic Path Monoids
Acta Cybernetica, 2017 Magnus Steinby
openalex +5 more sources
Locality and Centrality: The Variety ZG [PDF]
Logical Methods in Computer Science, 2023 We study the variety ZG of monoids where the elements that belong to a group are central, i.e., commute with all other elements. We show that ZG is local, that is, the semidirect product ZG * D of ZG by definite semigroups is equal to LZG, the variety of
Antoine Amarilli, Charles Paperman
doaj +1 more source
Theoretical Computer Science, 2005 AbstractWe deal with the maximal bifix code construction which is a natural generalization of a group code construction. For a surjective morphism ϕ from a free monoid A* onto a completely simple semigroup with an adjoined identity M(G;I,J;Σ)1 and a submonoid S of M(G;I,J;Σ)1, under certain conditions, the base of a submonoid ϕ-1(S) is a maximal bifix ...
Genjiro Tanaka
openalex +3 more sources
Group Fuzzy Languages and its Generalizations
Ratio Mathematica, 2023 In fuzzy language theory, every monoid is the syntactic monoid of some fuzzy language. By using this result the properties of fuzzy language can be studied by the algebraic properties of the syntactic monoids. There are so many methods for studying fuzzy
Archana Vasudevan Pillai Prasanna +2 more
doaj +1 more source
Minimal state automata for detecting a β globin gene mutation
International Journal of Applied Mathematics and Computer Science, 2021 Beta-thalassemia is an autosomal recessive blood disorder characterized by abnormalities in the synthesis of β globin. Together with α globin, it is a subunit of globin protein, called hemoglobin, located inside our red blood cells to deliver oxygen from
Ferdania Devi Fitri +4 more
doaj +1 more source