A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ

Order ◽  
2018 ◽  
Vol 36 (2) ◽  
pp. 209-224 ◽  
Author(s):  
Hans-Jürgen Bandelt ◽  
Maurice Pouzet
Keyword(s):  
Free Monoid ◽  
Macneille Completion ◽  
Syntactic Approach

FINITELY BASED WORDS

2000 ◽  
Vol 10 (04) ◽  
pp. 457-480 ◽  
Author(s):  
OLGA SAPIR
Keyword(s):  
Sufficient Conditions ◽  
Basis Property ◽  
Free Monoid ◽  
Finite Basis ◽  
Finitely Based ◽  
Finite Basis Property ◽  
Letter Alphabet ◽  
Finite Language ◽  
Rees Quotient ◽  
The Ideal

Let W be a finite language and let Wc be the closure of W under taking subwords. Let S(W) denote the Rees quotient of a free monoid over the ideal consisting of all words that are not in Wc. We call W finitely based if the monoid S(W) is finitely based. Although these semigroups have easy structure they behave "generically" with respect to the finite basis property [6]. In this paper, we describe all finitely based words in a two-letter alphabet. We also find some necessary and some sufficient conditions for a set of words to be finitely based.

scholarly journals G. Czédli’s tolerance factor lattice construction and weak ordered relations

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Sándor Radeleczki
Keyword(s):  
Concept Lattice ◽  
Tolerance Factor ◽  
Macneille Completion ◽  
Lattice Construction

AbstractG. Czédli proved that the blocks of any compatible tolerance T of a lattice L can be ordered in such a way that they form a lattice L/T called the factor lattice of L modulo T. Here we show that the Dedekind–MacNeille completion of the lattice L/T is isomorphic to the concept lattice of the context (L, L, R), where R stands for the reflexive weak ordered relation $$ \mathord {\le } \circ T$$ ≤ ∘ T . Weak ordered relations constitute the generalization of the ordered relations introduced by S. Valentini. Reflexive weak ordered relations can be characterized as compatible reflexive relations $$R\subseteq L^{2}$$ R ⊆ L 2 satisfying $$R=\ \mathord {\le } \circ R\circ \mathord {\le } $$ R = ≤ ∘ R ∘ ≤ .

A generalization of the Dedekind–MacNeille completion

2017 ◽  
Vol 96 (3) ◽  
pp. 553-564 ◽  
Author(s):  
Zhongxi Zhang ◽  
Qingguo Li
Keyword(s):  
Macneille Completion

Generalized dimension of an ordered set and its MacNeille completion

Order ◽  
1994 ◽  
Vol 11 (2) ◽  
pp. 135-148
Author(s):  
Philippe Baldy ◽  
Jutta Mitas
Keyword(s):  
Ordered Set ◽  
Macneille Completion ◽  
Generalized Dimension

Syntactic Dependencies as Memorized Sequences in the Brain

2005 ◽  
Vol 50 (1-4) ◽  
pp. 241-266 ◽  
Author(s):  
Yosef Grodzinsky
Keyword(s):  
Working Memory ◽  
Inferior Frontal Gyrus ◽  
Functional Neuroanatomy ◽  
Left Inferior Frontal Gyrus ◽  
Broca’S Region ◽  
Syntactic Representation ◽  
Syntactic Approach ◽  
Syntactic Relations ◽  
Syntactic Dependencies ◽  
The Brain

AbstractThe prospects of a cognitive neuroscience of syntax are considered with respect to functional neuroanatomy of two seemingly independent systems: Working Memory and syntactic representation and processing. It is proposed that these two systems are more closely related than previously supposed. In particular, it is claimed that a sentence with anaphoric dependencies involves several Working Memories, each entrusted with a different linguistic function. Components of Working Memory reside in the Left Inferior Frontal Gyrus, which is associated with Broca’s region. When lesioned, this area manifests comprehension disruptions in the ability to analyze intra-sentential dependencies, suggesting that Working Memory spans over syntactic computations. The unification of considerations regarding Working Memory with a purely syntactic approach to Broca’s regions leads to the conclusion that mechanisms that compute transformations—and no other syntactic relations—reside in this area.

scholarly journals Disjunctive languages on a free monoid

1977 ◽  
Vol 34 (2) ◽  
pp. 123-129 ◽  
Author(s):  
H.J. Shyr
Keyword(s):  
Free Monoid

scholarly journals TINJAUAN ELIPSIS PADA KALIMAT KONDISIONAL BAHASA ARAB

Jurnal CMES ◽  
2017 ◽  
Vol 6 (2) ◽  
pp. 164
Author(s):  
Afnan Arummi
Keyword(s):  
Theoretical Concept ◽  
Grammatical Structure ◽  
Conditional Sentence ◽  
Syntactic Approach ◽  
The Relationship

One of the unique Arabic languages is an ellipsis system or one of the elements<br />contained in an utterance.  Among the Arabic sentence systems getting ellipsis is<br />conditional sentences (al-jumlah a‟sy-syarthiyyah). This article describes the study of<br />ellipsis in Arabic conditional sentence reviewed from the linguistics perspective. The<br />discussion in this study is focused on the theoretical concept of conditional sentences in<br />Arabic and the concept of ellipsis (hadzf) specifically. Syntactic approach is used in this<br />research to assess the grammatical structure as conditional markers, the relationship<br />between the clauses of conditional sentences, the relationship between conditional<br />sentences with other linguistic elements.

Sign in / Sign up

Export Citation Format

Share Document