| This SO library realizes algorithms, based on automata theory and author's methods.
It is demo version of toolkit, which may be used for very wide range
of developments like parsers, interpreters, compillers, object and event oriented libraries,
modules for operating systems, evironments, recognition patterns, making hypothesis ,
different management and control systems etc. The main purpose of this issue is to demonstrate one more approache
to solving the following tasks :
1. Considering systems with fussy logic and big number of parameters as approximation
by nondetermined finite state automaton.
2. Modelling process of making hypothesis with considering completed tree of alternatives. The following methods were developed :
1. Usage of separately masked both input and output states in automaton transitions, that allows to create automatons with big number of parameters.
2. Forming and processing tree of alternative transitions on fly. This is the very basic development, has the limitations.
One of them is including completed space of alternatives in tree.
The filtering transitions and other customization is the matter of additional developments.
This demo version consists of libndautom1d0.so, ndautom1d0_doc.h with commentaries
and simple example in ndautomex1.cpp with commentaries. The toolkit is still experimental. It is currently available as a
Linux shared library, which was compiled with g++2.96 under RedHat 9.0. The steps to try applied example are:
1) to install libndautom1d0.so file;
2) to build example with :
g++296 -fPIC -c -Wall ndautomex1.cpp ;
g++296 -o ndautomex1 ndautomex1.o -lndautom1d0 . For bug reports, please
contact the mailto:valstas@onlinehome.de .
|
