𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Logical Description of Context-free Graph Languages

✍ Scribed by Joost Engelfriet; Vincent van Oostrom


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
378 KB
Volume
55
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The Set of Minimal Words of a Context-fr
✍ 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 Description of Claw-Free Perfect Graph
✍ FrΓ©dΓ©ric Maffray; Bruce A. Reed πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 249 KB

It is known that all claw-free perfect graphs can be decomposed via clique-cutsets into two types of indecomposable graphs respectively called elementary and peculiar (1988, V. Chva tal and N. Sbihi, J. Combin. Theory Ser. B 44, 154 176). We show here that every elementary graph is made up in a well

When a graph is poorer than 100 words: A
✍ Marian van der Meulen; Robert H. Logie; Yvonne Freer; Cindy Sykes; Neil McIntosh πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 275 KB πŸ‘ 1 views

## Abstract Volunteer staff from a Neonatal Intensive Care Unit (NICU) were presented with sets of anonymised physiological data recorded over approximately 45 minute periods from former patients. Staff were asked to select medical/nursing actions appropriate for each of the patients whose data wer