Wyniki wyszukiwania - BazTech

1

On String Languages Generated by Sequential Numerical P Systems

Zhang Z., Wu T., Pan L.

Fundamenta Informaticae

|

2016

|

Vol. 145, nr 4

485--509

EN

Numerical P systems are a class of P systems inspired both from the structure of living cells and from economics. In this work, we further investigate the generative capacity of numerical P systems as language generators. The families of languages generated by non-enzymatic, by enzymatic, and by purely enzymatic (all programs are enzymatic) numerical P systems working in the sequential mode are compared with the language families in the Chomsky hierarchy. Especially, a characterization of recursively enumerable languages is obtained by using purely enzymatic numerical P systems working in the sequential mode.

2

Spatially Localised Membrane Systems

Csuhaj-Varjú E., Gheorghe M., Stannett M., Vaszil G.

Fundamenta Informaticae

|

2015

|

Vol. 138, nr 1/2

193--205

EN

In this paper we investigate the use of general topological spaces in connection with a generalised variant of membrane systems. We provide an approach which produces a fine grain description of local operations occurring simultaneously in sets of compartments of the system by restricting the interactions between objects. This restriction is given by open sets of a topology and multisets of objects associated with them, which dynamically change during the functioning of the system and which together define a notion of vicinity for the objects taking part in the interactions.

3

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters

Dassow J., Manea F., Truthe B.

Fundamenta Informaticae

|

2015

|

Vol. 136, nr 1/2

1--35

EN

In this paper, we approach the problemof accepting all recursively enumerable languages by accepting networks of evolutionary processors (ANEPs, for short) with a fixed architecture. More precisely, we show that every recursively enumerable language can be accepted by an ANEP with an underlying graph in the form of a star with 13 nodes or by an ANEP with an underlying grid with 13 × 4 = 52 nodes as well as by ANEPs having underlying graphs in the form of a chain, a ring, or a wheel with 29 nodes each. In all these cases, the size and form as well as the general working strategy of the constructed networks do not depend on the accepted language; only the rewriting rules and the filters associated to each node of the networks depend on this language. Noteworthy is also the fact that the filtering process is implemented using random context conditions only. Our results answer problems which were left open in a paper published by J. Dassow and F. Manea at the conference on Descriptional Complexity of Formal Systems (DCFS) 2010 and improve a result published by B. Truthe at the conference on Non-Classical Models of Automata and Applications (NCMA) 2013.

4

Blackhole Pushdown Automata

Csuhaj-Varjú E., Masopust T., Vaszil G.

Fundamenta Informaticae

|

2011

|

Vol. 112, nr 2/3

137-156

EN

We introduce and investigate blackhole pushdown automata, variants of pushdown automata, where a string can always be pushed to the pushdown, but only a given depth of the pushdown content is remembered (the rest of the pushdown content is either canceled or becomes inaccessible). We also study blackhole variants of regulated pushdown automata, where the automaton in some distinguished states checks the form of its pushdown content against a given control language. We present characterizations of several language families in terms of these constructs.

5

Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case

Masopust T.

Fundamenta Informaticae

|

2010

|

Vol. 104, nr 1/2

111-124

EN

We continue the investigation of pushdown automata which are allowed to make a nondeterministic decision if and only if their pushdown content forms a string belonging to a given control language. We prove that if the control language is linear and non-regular, then the power of pushdown automata regulated in this way is increased to the power of Turing machines. From a practical point of view, however, it is inefficient to check the form of the pushdown content in each computational step. Therefore, we prove that only two checks of the pushdown content are of interest for these machines to be computationally complete. Based on this observation, we introduce and discuss a new model of regulated pushdown automata.

6

Możliwości i perspektywy współczesnej grafiki komputerowej

Szuba T.

Roczniki Geomatyki

|

2009

|

T. 7, z. 6

97-103

EN

The paper deals with the problem: what is modern computer graphics now and what is its potential. If we think in terms of .the centre of gravity., modern computer graphics is moving from the art towards capturing the essence of an object or a being to be modeled. In other words, key problems for the computer graphics are physical phenomena (e.g. liquids), mechanical properties (e.g. textile, hairs) or even mental properties of virtual beings. Therefore, modern computer graphics requires extremely high computational abilities. Advanced computer games demonstrate this very well. Having all this in mind, many researchers think that modern computer graphics is the main leading force in the development of modern computer science. On the basis of above remarks, the paper tries to resume the application areas of modern computer graphics now and in the near future.

7

Dynamical teams in eco-grammar systems

Csuhaj-Varju E., Mitrana V.

Fundamenta Informaticae

|

2000

|

Vol. 44, Nr 1,2

83-94

EN

In this paper we investigate simple eco-grammar systems with dynamically formed teams of agents. Three natural conditions for constituting a team, based on the agents' current capability of activation, are considered. We study the relations of language classes of these simple eco-grammar systems to each other and to some other well-known classes of languages. Moreover, we prove that any recursively enumerable language can be obtained as the intersection of a regular language and the language of a simple eco-grammar system where the acting teams of agents are formed according to two of the above conditions.