𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Context free derivations on word monoids

✍ Scribed by Alexander Meduna

Book ID
104691137
Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
294 KB
Volume
27
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On lengths of words in context-free lang
On lengths of words in context-free languages
✍ Lucian Ilie πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 292 KB

We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. It is known that the slender context-free languages are precisely the unions of paired loops, that is, ΓΏnite unions of sets of the form {uv n wx n y | nΒΏ0}. Analysi

Fuzzy language on free monoid
Fuzzy language on free monoid
✍ Jizhong Shen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 721 KB
The Set of Minimal Words of a Context-fr
The Set of Minimal Words of a Context-free Language is Context-free
✍ Jean Berstel; L. Boasson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A\*. Let X be a subset of A\*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: The aim of this paper is to prove that if L is a context-

A Note on Words in Braid Monoids
A Note on Words in Braid Monoids
✍ Jean Michel πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 152 KB