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

Decidability of the unification problem for second-order languages with unary functional symbols

โœ Scribed by A. P. Zhezherun

Publisher
Springer US
Year
1980
Tongue
English
Weight
745 KB
Volume
15
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Decidability of the consistency problem
Decidability of the consistency problem for regular symbolic picture description languages
โœ G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 86 KB

In the paper we address the consistency problem for drawn symbolic picture grammars. In particular we prove that it is always possible to decide whether or not a regular grammar generates only consistent descriptions of drawn symbolic pictures.

On the numerical approximation of some t
On the numerical approximation of some types of nonstandard second-order eigenvalue problems for vector valued functions
โœ Hennie De Schepper; Roger Van Keer ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 147 KB

In this paper we consider some types of second-order elliptic eigenvalue problems (EVPs) for vector valued functions on a convex polygonal domain in the plane, with nonstandard boundary conditions (BCs) of nonlocal type. The aim of the paper is twofold. First, we pass to a variational form of the EV