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
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-
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
## 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