Wyniki wyszukiwania - BazTech

1

On Networks of Evolutionary Processors with Nodes of Two Types

Alhazov A., Martin-Vide C., Truthe B., Dassow J., Rogozhin Y.

Fundamenta Informaticae

|

2009

|

Vol. 91, nr 1

1-15

EN

We discuss the power of networks of evolutionary processors where only two types of nodes are allowed. We prove that (up to an intersection with a monoid) every recursively enumerable language can be generated by a network with one deletion and one insertion node. Networks with an arbitrary number of deletion and substitution nodes only produce finite languages, and for each finite language one deletion node or one substitution node is sufficient. Networks with an arbitrary number of insertion and substitution nodes only generate context-sensitive languages, and (up to an intersection with a monoid) every context-sensitive language can be generated by a network with one substitution node and one insertion node. All results are optimal with respect to the number of nodes.

2

On the Analysis of Fuzzy String Patterns with the Help of Extended and Stochastic GDPLL(k) Grammars

Flasiński M., Jurek J.

Fundamenta Informaticae

|

2006

|

Vol. 71, nr 1

1-14

EN

Two methods of the analysis of distorted (fuzzy) string patterns are presented. The methods are based on the use of GDPLL(k ) grammars generating a large subclass of context sensitive languages. The first one utilizes error-correcting approach: a minimum distance measure is used for error-correcting parsing. The second one utilizes stochastic approach: the decision about the production to be applied in a derivation step is given according to the probability measure.

3

The Object-oriented Architecture of the Syntactic Pattern-recognition System Based on GDPLL(k) Grammars

Jurek J.

Schedae Informaticae

|

2004

|

Vol. 13

83-102

EN

The syntactic pattern recognition model based on GDPLL (k) grammars has been proposed [6, 13] as an efficient tool for inference support in diagnostic and control expert systems. In this paper we discuss the software engineering aspect of the syntactic pattern recognition (sub)system. The architecture of the system should allow to embed the system in real-time environments, accumulate knowledge about the environment, and flexible react to the changes in the environment. The object-oriented approach has been applied to design the system, and the Unified Modeling Language has been used for the specification of the software model. In the paper we presented the model and its practical applications.

4

On the construction of transition functions for DPLL(k) automata for syntactic pattern recognition

Jurek J.

Machine Graphics and Vision

|

2003

|

Vol. 12, No. 4

489-513

EN

DPLL(k) automata have been introduced as a tool for inference support in pattern recognition-based real-time expert systems. The automata can be characterised by the two following features: they can recognise languages of a big descriptive power (quasi context sensitive languages), and they are efficient (i.e. they are of linear computational complexity). The two features make the automata useful in case of many practical applications, such as the on-line analysis of complex trend functions describing behaviour of industrial equipment. In this paper we present a method for construction of transition functions for the automata and a formal proof of its correctness.