Manfred Kudlek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Manfred Kudlek has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ludwik Czaja
Vistula University
4 shared publications - Alexandru Mateescu
Faculty of Mathematics, University of Bucharest, Romania
2 shared publications - A. Mateescu
University of Bucharest
1 shared publication - Carlos Martín-Vide
Rovira i Virgili University
1 shared publication - Solomon Marcus
University of Bucharest
1 shared publication - Victor Mitrana
University of Bucharest
1 shared publication
Latest Publications
- 1 January 2011
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 109 (3) , 297-304
A Relation between Modal Logic and Language Closure Operators
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.
- 1 January 2011
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 109 (3) , 297-304
A Relation between Modal Logic and Language Closure Operators
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.
- 1 January 2011
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 112 (1) , 39-45
On Synthesis and Analysis of Generalized Work Flow Net Structures and Transition Graphs
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.
- 1 January 2011
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 112 (1) , 39-45
On Synthesis and Analysis of Generalized Work Flow Net Structures and Transition Graphs
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.
- 1 January 2010
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 101 (1-2) , 1-7
Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations
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.
- 1 January 2010
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 101 (1-2) , 1-7
Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations
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.
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 93 (1-3) , 97-110
Analysis and Synthesis of Net Structures and Transition Graphs
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.
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 93 (1-3) , 97-110
Analysis and Synthesis of Net Structures and Transition Graphs
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.
- 1 December 2003
- Published by Springer Nature in Linguistics and Philosophy
- Vol. 26 (6) , 703-725
Contexts and the Concept of Mild Context-Sensitivity
- 1 December 2003
- Published by Springer Nature in Linguistics and Philosophy
- Vol. 26 (6) , 703-725
Contexts and the Concept of Mild Context-Sensitivity
- 1 September 2000
- Published by Springer Nature in Acta Informatica
- Vol. 37 (2) , 145-160
Some results on the Collatz problem
- 1 September 2000
- Published by Springer Nature in Acta Informatica
- Vol. 37 (2) , 145-160
Some results on the Collatz problem
- 1 January 2000
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 43 (1-4) , 49-60
Rational, Linear and Algebraic Process Languages and Iteration Lemmata
In this paper we define a certain class of process languages viewing processes as bipartite graphs with an associative operation (sequential composition) on them. They describe finite evolutions of Petri nets. When extended to sets, we get an ω-complete semiring such that rational, linear, and algebraic sets of such processes can be defined as least fixed points of systems of equations. With a norm of processes also iteration lemmata can be obtained. Finally, we also present a related structure of directed acyclic graphs.
- 1 January 2000
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 43 (1-4) , 49-60
Rational, Linear and Algebraic Process Languages and Iteration Lemmata
In this paper we define a certain class of process languages viewing processes as bipartite graphs with an associative operation (sequential composition) on them. They describe finite evolutions of Petri nets. When extended to sets, we get an ω-complete semiring such that rational, linear, and algebraic sets of such processes can be defined as least fixed points of systems of equations. With a norm of processes also iteration lemmata can be obtained. Finally, we also present a related structure of directed acyclic graphs.
- 1 January 1999
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 37 (4) , 413-422
Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages
Using general iteration lemmata for languages defined by rational, linear, and algebraic systems of equations on ω-complete semirings, it can be shown that such iteration lemmata hold for certain classes of word and trace languages, and for process algebra classes related to them. The basic operation has to be associative with a neutral element, and is extended to sets of elements, such that the structure defined by it together with union and ∅ is an ω-complete semiring. With this property rational, linear and algebraic systems of equations can be defined, having a unique minimal solution as least fixed points. To guarantee iteration lemmata for the corresponding rational, linear and algebraic classes, a norm on the structure has to exist, fulfilling some monotonicity on union and extended operation on sets. This article is an extended version of the paper presented at the workshop CS&P'98 in Berlin, September 28-30, 1998.
- 1 January 1999
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 37 (4) , 413-422
Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages
Using general iteration lemmata for languages defined by rational, linear, and algebraic systems of equations on ω-complete semirings, it can be shown that such iteration lemmata hold for certain classes of word and trace languages, and for process algebra classes related to them. The basic operation has to be associative with a neutral element, and is extended to sets of elements, such that the structure defined by it together with union and ∅ is an ω-complete semiring. With this property rational, linear and algebraic systems of equations can be defined, having a unique minimal solution as least fixed points. To guarantee iteration lemmata for the corresponding rational, linear and algebraic classes, a norm on the structure has to exist, fulfilling some monotonicity on union and extended operation on sets. This article is an extended version of the paper presented at the workshop CS&P'98 in Berlin, September 28-30, 1998.
- 1 January 1998
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 33 (3) , 249-264
Algebraic, Linear and Rational Languages Defined by Mix Operation
We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets, one of them having some priority. Such operations are generalizations of the classical catenation or shuffle operation, with which rational,
- 1 January 1998
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 33 (3) , 249-264
Algebraic, Linear and Rational Languages Defined by Mix Operation
We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets, one of them having some priority. Such operations are generalizations of the classical catenation or shuffle operation, with which rational,
- 1 January 1997
- Published by Springer Nature
- p. 269-280
Contextual grammars with distributed catenation and shuffle
- 1 January 1997
- Published by Springer Nature
- p. 269-280
Contextual grammars with distributed catenation and shuffle