𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bounded degree problem for NLC grammars is decidable

✍ Scribed by Dirk Janssens; Grzegorz Rozenberg; Emo Welzl

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
540 KB
Volume
33
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An ILP formulation and genetic algorithm
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
✍ Milena BogdanoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 344 KB

A general instance of a Degree-Constrained Subgraph problem may be found in an edgeweighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been e

The emptiness of intersection problem fo
The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable
✍ Annie Foret πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 465 KB

This paper is concerned with usual decidability questions on grammars for some classes of categorial grammars that arise in the field of learning categorial grammars. We prove that the emptiness of intersection of two langages is an undecidable problem for the following classes : k-valued classical