✦ LIBER ✦

Languages for automation

✍ Scribed by Zvieli, Arie

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 829 KB
Volume: 38
Category: Article
ISSN: 0002-8231
DOI: 10.1002/(sici)1097-4571(198705)38:3<219::aid-asi18>3.0.co;2-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SNMP for home automation

✍ Ran Giladi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract Home and building automation applications impose the need for convergence, or at least interoperability, of data networks with intelligent building networks. This situation entails the use of a unified management system. In this paper we extend the traditional SNMP‐based network managem

Automated software development with XML

Automated software development with XML and the Java* language

✍ Glenn R. Bruns; Alan E. Frey; Peter A. Mataga; Susan J. Tripp 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 104 KB 👁 1 views

Index sets for ω-languages

✍ Douglas Czenzer; Jeffrey B. Remmel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of au

Consistency in Categorical Languages for

Consistency in Categorical Languages for Algebras

✍ Ahmad Shafaat 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

Implementation of automated fine-granula

Implementation of automated fine-granularity locking in a persistent programming language

✍ L. Daynès 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB 👁 1 views

To gain broader acceptance, Persistent Programming Languages (PPL) need a better integration of the transaction paradigm. Much like database systems, computations should all run in the context of a transaction; the transactional properties should be applied to all objects irrespective of their type

Restorations of punctured languages and

Restorations of punctured languages and similarity of languages

✍ Gerhard Lischke 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with simil