LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ
Some Logical and Automata-Theoretic Aspects of Product Behaviours
β Scribed by P.S. Thiagarajan
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 69 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The dependence of the stability of ionic micelles on the ionic strength of the medium is examined analytically without recourse to any explicit expression of the surface potential of micelles. The present study is based on the idea developed by Evans, Mitchell, and Ninham (D. F. Evans, D. J. Mitchel
From a mathematical point of view, the use of triangular norms as connectives in many-valued, in particular in [0, 1]valued logics and fuzzy logics is discussed. Also, an overview of some non-additive generalizations of classical measures is given. (~) 1997 Elsevier Science B.V.