Ivo Damyanov | South-Western University - Blagoevgrad (original) (raw)

Uploads

Papers by Ivo Damyanov

Research paper thumbnail of Effective data extraction with schema-driven tools

Research paper thumbnail of Automatic Code Generation and Re-Generation in Software Development Process

Research paper thumbnail of On an Application Design Suitable for Model Driven Code Generation

Research paper thumbnail of On Two Adaptive Systems for Document Management

Research paper thumbnail of Building Real-Time Web Applications with SignalR and NoSQL Databases

Research paper thumbnail of From Structure to Behavior - Defining Declarative Language Grammars with XML

Research paper thumbnail of On the complexity of finite valued functions

The essential variables in a finite function fff are defined as variables which occur in fff and ... more The essential variables in a finite function fff are defined as variables which occur in fff and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When replacing some variables in a function with constants the resulting functions are called subfunctions, and when replacing all essential variables in a function with constants we obtain an implementation of this function. Such an implementation corresponds with a path in an ordered decision diagram (ODD) of the function which connects the root with a leaf of the diagram. The sets of essential variables in subfunctions of fff are called separable in fff. In this paper we study several properties of separable sets of variables in functions which directly impact on the number of implementations and subfunctions in these functions. We define equivalence relations which classify the functions of kkk-valued logic into classes with same number of implementa...

Research paper thumbnail of Domain Specific Languages in Practice

International Journal of Computer Applications, 2015

Research paper thumbnail of On the classification of Boolean functions

Research paper thumbnail of ON SOME PROPERTIES OF BOOLEAN FUNCTIONS AND THEIR BINARY DECISION DIAGRAMS

Research paper thumbnail of Essential Inputs and Minimal Tree Automata

Computing Research Repository, 2007

We continue studying essential inputs of trees and automata. Strongly essential inputs of trees a... more We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are shown.

Research paper thumbnail of Metadata driven code generation using .NET framework

Research paper thumbnail of Effective data extraction with schema-driven tools

Research paper thumbnail of Automatic Code Generation and Re-Generation in Software Development Process

Research paper thumbnail of On an Application Design Suitable for Model Driven Code Generation

Research paper thumbnail of On Two Adaptive Systems for Document Management

Research paper thumbnail of Building Real-Time Web Applications with SignalR and NoSQL Databases

Research paper thumbnail of From Structure to Behavior - Defining Declarative Language Grammars with XML

Research paper thumbnail of On the complexity of finite valued functions

The essential variables in a finite function fff are defined as variables which occur in fff and ... more The essential variables in a finite function fff are defined as variables which occur in fff and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When replacing some variables in a function with constants the resulting functions are called subfunctions, and when replacing all essential variables in a function with constants we obtain an implementation of this function. Such an implementation corresponds with a path in an ordered decision diagram (ODD) of the function which connects the root with a leaf of the diagram. The sets of essential variables in subfunctions of fff are called separable in fff. In this paper we study several properties of separable sets of variables in functions which directly impact on the number of implementations and subfunctions in these functions. We define equivalence relations which classify the functions of kkk-valued logic into classes with same number of implementa...

Research paper thumbnail of Domain Specific Languages in Practice

International Journal of Computer Applications, 2015

Research paper thumbnail of On the classification of Boolean functions

Research paper thumbnail of ON SOME PROPERTIES OF BOOLEAN FUNCTIONS AND THEIR BINARY DECISION DIAGRAMS

Research paper thumbnail of Essential Inputs and Minimal Tree Automata

Computing Research Repository, 2007

We continue studying essential inputs of trees and automata. Strongly essential inputs of trees a... more We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are shown.

Research paper thumbnail of Metadata driven code generation using .NET framework

Log In