Economic evaluation of proposed pure and mixed stands in Central Vietnam highlands

In comparison with mixed forest stands, the cultivation of pure plantations in Vietnam entails serious ecological consequences such as loss of biodiversity and higher rate of soil erosion. The economic evaluation is elaborated between pure plantations and mixed forests where the fast-growing tree species are mixed with slow growing tree species which are planted in stripes separating the segments with fast-growing tree species (Acacia sp.). For the evaluation, the input values were used from local costs of goods, services and labour. The results show that the internal rate of return is the highest in the case of pure plantation in comparison with mixed forests – 86% to 77%(first planting pattern: Acacia sp. + noble hardwood species) and 54% (second planting pattern: Acacia + Dipterocarpus sp. + Sindora sp.). The average profit per hectare and year is almost five times higher in the case of mixed stands. The first planting pattern reaches 2,650 $, the second planting pattern 2,280 $ and the pure acacia plantation only 460 $. From an economic point of view, the cultivation of mixed forests that corresponds to the principles of sustainable forestry generates a good economical profit while maintaining habitat complexity and biodiversity.

On the Gap-Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-RL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-RL-automata with an unbounded number of gaps accept NP-complete languages.

On the Descriptional Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. We focus on the descriptional complexity of these automata, establishing two complexity measures that are both based on the description of t-sRL-automata in terms of so-called meta-instructions. We present some hierarchy results as well as a non-recursive trade-off between deterministic 2-sRL-automata and finite-state acceptors.