PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 26

Liczba wyników na stronie
first rewind previous Strona / 2 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 2 next fast forward last
1
Content available remote Zastosowanie biotestów we wstępnej ocenie jakości wody basenu szkolnego
Łaskawiec E., Kudlek M., Dudziak M., Wyczarska-Kokot J.
Gaz, Woda i Technika Sanitarna
|
2016
|
Nr 9
330--334
PL
W pracy przedstawiono oddziaływanie związków chemicznych, w tym ubocznych produktów dezynfekcji (DBP) występujących w wodach basenowych na wybrane organizmy wskaźnikowe. Ocenę toksykologiczną poprzedzono krótką analizą podstawowych parametrów fizykochemicznych. Wykonane biotesty obejmowały zróżnicowaną grupę organizmów, tj. bakterie Aliivibrio fischeri, skorupiaki Daphnia magna, larwy owadów Chaoborus fahicans oraz rośliny naczyniowe Lemna minor. Analizowano korelację pomiędzy wynikami testów, co w przyszłości umożliwi wybór organizmów wskaźnikowych przydatnych w ocenie jakości wód basenowych.
EN
The study presents the impact of chemical substances present in swimming pool water, including disinfection by-products (DBP), on selected indicator organisms. Toxicological assessment was preceded by brief analysis of basic physicochemical parameters. The performed biotests involved a varied group of organisms, including bacteria (Aliivibrio fischeri), crustaceans (Daphnia magna), insect larvae (Chaoborus falvicans), and vascular plants (Lemna minor). Consideration was given to correlations between the results of the tests that will facilitate future selection of indicator organisms to be used in the assessment of quality of swimming pool waters.
2
Content available remote Properties of Languages with Catenation and Shuffle
Kudlek M., Flick N. E.
Fundamenta Informaticae
|
2014
|
Vol. 129, nr 1/2
117--132
EN
We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow.
3
Content available remote A Hierarchy of Languages with Catenation and Shuffle
Kudlek M., Flick N. E.
Fundamenta Informaticae
|
2013
|
Vol. 128, nr 1-2
113--128
EN
We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closures or least fixed point solutions to systems of equations.
4
Content available remote On Synthesis and Analysis of Generalized Work Flow Net Structures and Transition Graphs
Czaja L., Kudlek M.
Fundamenta Informaticae
|
2011
|
Vol. 112, nr 1
39-45
EN
We show that the results on analysis of net structures and transition graphs exhibited in [1] can be apllied also to generalized work flow net structures and related transition graphs.
5
Content available remote A Relation between Modal Logic and Language Closure Operators
Kudlek M.
Fundamenta Informaticae
|
2011
|
Vol. 109, nr 3
297-304
EN
Between modal logic and closure operators for topological spaces as well as for formal languages there exists a strong relation. Modal logic allows to define classes of formal languages in several ways.
6
Content available remote Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations
Czaja L., Kudlek M.
Fundamenta Informaticae
|
2010
|
Vol. 101, nr 1/2
1-7
EN
We extend the investigation of synthesis and analysis of net structures and transition graphs to such with inhibitor relations, and show that the results obtained for the simpler case can be extended, too.
7
Content available remote Properties of Multiset Language Classes Defined by Multiset Pushdown Automata
Kudlek M., Totzke P., Zetzsche G.
Fundamenta Informaticae
|
2009
|
Vol. 93, nr 1-3
235-244
EN
The previously introduced multiset language classes defined by multiset pushdown automata are being explored with respect to their closure properties and alternative characterizations.
8
Content available remote Multiset Pushdown Automata
Kudlek M., Totzke P., Zetzsche G.
Fundamenta Informaticae
|
2009
|
Vol. 93, nr 1-3
221-233
EN
Multiset finite Automata, a model equivalent to regular commutative grammars, are extended with a multiset store and the accepting power of this extended model of computation is investigated. This type of multiset automata come in two flavours, varying only in the ability of testing the storage for emptiness. This paper establishes normal forms and relates the derived language classes to each other as well as to known multiset language classes.
9
Content available remote Analysis and Synthesis of Net Structures and Transition Graphs
Czaja L., Kudlek M.
Fundamenta Informaticae
|
2009
|
Vol. 93, nr 1-3
97-110
EN
We investigate relations between transition graphs and net structures. Whereas for a given net structure there always exists a reachability graph, the inverse problem to find a net structure for a given transition graph is not solvable in general. We present sufficient and necessary conditions for several classes of transition graphs such as general, pseudo-bounded, bounded and elementary transition graphs, corresponding to general and (pseudo-)bounded P/T nets or C/E nets. We also give maximal and minimal solutions within an algebraic structure of net structures. The entire investigation is formulated in the framework of multiset theory.
10
Content available remote Petri Net Controlled Finite Automata
Farwer B., Jantzen M., Kudlek M., Rölke H., Zetzsche G.
Fundamenta Informaticae
|
2008
|
Vol. 85, nr 1-4
111-121
EN
We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by l-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages.
11
Content available remote Linear Properties of Zero-Safe Nets with Debit Tokens
Köhler-Bußmeier M., Kudlek M.
Fundamenta Informaticae
|
2008
|
Vol. 85, nr 1-4
329-342
EN
In this contribution we study an extension of zero-safe nets that allows to model cooperation scenarios. Since zero-safe nets cannot be represented as finite nets in general, we study an extension of the firing rule having a close connection to blind counter automatons and the theory of semi-flows. As a main result we obtain, that a representation can always be given as a finite P/T net - although our firing rule is an extension of the original one - i.e. it preserves all the events that have been allowed before.
12
Content available remote Language Classes Defined by Concurrent Finite Automata
Jantzen M., Kudlek M., Zetzsche G.
Fundamenta Informaticae
|
2008
|
Vol. 85, nr 1-4
267-280
EN
This paper presents results regarding the various relations among the language classes defined by Concurrent Finite Automata, relations to other language classes, as well as decidability and closure properties.
13
Content available remote On Semilinear Sets over Commutative Semirings
Kudlek M.
Fundamenta Informaticae
|
2007
|
Vol. 79, nr 3-4
447-452
EN
The concept of semilinear sets is generalized to commutative semirings. It is shown that the semilinear sets over commutative semirings are exactly the algebraic/rational sets over such structures.
14
Content available remote Decidability Problems of a Basic Class of Object Nets
Dietze R., Kudlek M., Kummer O.
Fundamenta Informaticae
|
2007
|
Vol. 79, nr 3-4
295-302
EN
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dickson's Lemma for a certain class of multisets, and a modified Karp Miller algorithm, is applied. This presents another class of nets with different decidability behaviour for reachability and boundedness.
15
Content available remote Concurrent Turing Machines
Farwer B., Kudlek M., Rölke H.
Fundamenta Informaticae
|
2007
|
Vol. 79, nr 3-4
303-317
EN
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) k-head Turing machines. Space, time, and head complexity classes are introduced and discussed showing the difference of various acceptance conditions that are defined for CTMs. Nevertheless, we show that CTMs can be simulated by TMs. Concurrent Turing machines correspond to a class of multiset rewriting systems. The definition of a CTMs as a rewrite theory avoids the need for encoding multisets as words and using an equivalence relation on configurations. Multiset rewriting lends itself to be used in rewriting systems and tools like the rewriting engine Maude. For the rewriting system, a configuration is given by a varying sequence of strings and multisets.
16
Content available remote On Quantum Vector Addition Systems
Kudlek M.
Fundamenta Informaticae
|
2006
|
Vol. 72, nr 1-3
255-261
EN
It is shown that there don't exist quantum vector addition systems on various underlying structures for every number of productions. However, if the underlying vector space is restricted, such quantum vector addition systems exist.
17
Content available remote Probability in Petri Nets
Kudlek M.
Fundamenta Informaticae
|
2005
|
Vol. 67, nr 1-3
121--130
EN
It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.
18
Content available remote On Probabilistic Contextual Grammars
Kudlek M.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
255-260
EN
A generalization of contextual grammars by adding probabilities is introduced, enriching the generative power of such grammars. An example exhibits a non-contextual, even not context-free language.
19
Content available remote New Iteration Lemmata for Regular Languages
Dömösi P., Kudlek M.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
151-157
EN
Using well-known characterizations of regular languages, on the basis of known iteration lemmas, new iteration lemmas for regular languages are given.
20
Content available remote A New Synchronisation Model for Multi-Level Object Petri Nets
Farwer B., Kudlek M.
Fundamenta Informaticae
|
2004
|
Vol. 60, nr 1-4
131--142
EN
The present paper continues work from [7]. One goal of this work is to find a class of (object) Petri nets of lesser power than Turing machines, such that there exists a universal Petri net within that class. Another goal is to surpass the restricted synchronisation of transitions in object and system nets in the case of value semantics. Finally, an encoding of the proposed class of object Petri nets into linear logic Petri nets (LLPNs) is given, which directly leads to a specification that can be model-checked by existing tools.
first rewind previous Strona / 2 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.