𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On permuting letters of words in context-free languages

✍ Scribed by Takeshi Oshiba

Book ID
114036942
Publisher
Elsevier Science
Year
1972
Weight
188 KB
Volume
20
Category
Article
ISSN
0019-9958

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

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-