Results 11 to 20 of about 184 (122)

Linear splicing and syntactic monoid

open access: closedDiscrete Applied Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BONIZZONI P   +3 more
openaire   +3 more sources

A syntactic approach to the MacNeille completion of $\bold��^{\ast}$, the free monoid over an ordered alphabet $\bold ��$ [PDF]

open access: green, 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 ...
Bandelt, Hans-J��rgen   +1 more
openaire   +2 more sources

On certain codes admitting inverse semigroups as syntactic monoids

open access: closedSemigroup 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)
Lallement, G., Keenan, M.
openaire   +2 more sources

Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes

open access: closedTheoretical Computer Science, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Norman R. Reilly
openaire   +3 more sources

Biprefix codes, inverse semigroups and syntactic monoids of injective automata

open access: closedTheoretical Computer Science, 1984
The author proves some properties of automata and semigroups. He shows that each injective automaton may be simulated by the minimal automaton of a language of the form \(B^*\), B a finite biprefix code. A similar result holds for any automaton, with ''biprefix'' replaced by ''prefix''.
T. E. Hall
openaire   +3 more sources

String Grammar Unsupervised Possibilistic Fuzzy C-Medians for Gait Pattern Classification in Patients with Neurodegenerative Diseases. [PDF]

open access: yesComput 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

On Croisot - languages and Dubreil - languages having a group as syntactic monoid.

open access: bronzeJournal of Computer Science and Cybernetics, 2012
Lê Quốc Hán, Hồ Tiến Dương
openaire   +3 more sources

On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups

open access: closedTheoretical Computer Science, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Genjiro Tanaka
openaire   +2 more sources

Home - About - Disclaimer - Privacy