๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of parallel parsing of general context-free languages

โœ Scribed by Wojciech Rytter

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
409 KB
Volume
47
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On regularity of context-free languages
On regularity of context-free languages
โœ A. Ehrenfeucht; D. Haussler; G. Rozenberg ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science โš– 112 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-