𝔖 Bobbio Scriptorium
✦   LIBER   ✦

H-bounded and semi-discrete languages

✍ Scribed by M. Kunze; H.J. Shyr; G. Thierrin

Book ID
114037556
Publisher
Elsevier Science
Year
1981
Weight
554 KB
Volume
51
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Substitution and bounded languages
Substitution and bounded languages
✍ Jonathan Goldstine πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 952 KB

necessarily context-free) bounded languages by full AFL operations, or from any set of' bounded context-free languages by full AFL operations and substitution.

Elementary bounded languages
Elementary bounded languages
✍ Sorin Istrail πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science βš– 492 KB
Left-derivation bounded languages
Left-derivation bounded languages
✍ S.J. Walljasper πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 331 KB

Left-derivation bounded languages are defined as those languages defined from context-free grammars by placing a bound on the number of nonterminals appearing in left-derivations. These languages are generated by left-derivation bounded grammars and form a full AFL not closed under reversal. The lef

Leftmove-bounded picture languages
Leftmove-bounded picture languages
✍ Changwook Kim; Ivan Hal Sudborough πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 134 KB

Let = {u; d; r; l} be the chain-code picture alphabet such that u (d; r; l) denotes the graphics command to move the drawing pen up (down, right, left) in the 2D Cartesian plane. It is known that the picture membership problem can be solved in polynomial time for each context-free language over {u;

Uniformly bounded duplication languages
Uniformly bounded duplication languages
✍ Peter Leupold; Carlos MartΓ­n-Vide; Victor Mitrana πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 197 KB