Manfred Kudlek

According to our database1, Manfred Kudlek
  • authored at least 75 papers between 1973 and 2014.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Properties of Languages with Catenation and Shuffle.
Fundam. Inform., 2014

2013
A Hierarchy of Languages with Catenation and Shuffle.
Fundam. Inform., 2013

2012
Report on CS&P 2011.
Bulletin of the EATCS, 2012

Report on AFL 2011.
Bulletin of the EATCS, 2012

Language Operators for Multiset Languages and Modal Logic.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

On a Hierarchy of Languages with Catenation and Shuffle.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

A Hierarchy of Languages with Catenation and Shuffle.
Proceedings of the 21th International Workshop on Concurrency, 2012

Properties of Languages with Catenation and Shuffle.
Proceedings of the 21th International Workshop on Concurrency, 2012

2011
A Relation between Modal Logic and Language Closure Operators.
Fundam. Inform., 2011

On Synthesis and Analysis of Generalized Work Flow Net Structures and Transition Graphs.
Fundam. Inform., 2011

On the Existence of Universal Finite or Pushdown Automata
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

2010
On Hamblin's 15 Tense Theorem.
Journal of Applied Non-Classical Logics, 2010

A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.
Journal of Automata, Languages and Combinatorics, 2010

Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations.
Fundam. Inform., 2010

2009
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata.
Fundam. Inform., 2009

Multiset Pushdown Automata.
Fundam. Inform., 2009

Analysis and Synthesis of Net Structures and Transition Graphs.
Fundam. Inform., 2009

2008
Linear Properties of Zero-Safe Nets with Debit Tokens.
Fundam. Inform., 2008

Language Classes Defined by Concurrent Finite Automata.
Fundam. Inform., 2008

Petri Net Controlled Finite Automata.
Fundam. Inform., 2008

Some Considerations on Universality
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

2007
Some Remarks on Quantum Automata.
Int. J. Found. Comput. Sci., 2007

On Semilinear Sets over Commutative Semirings.
Fundam. Inform., 2007

Concurrent Turing Machines.
Fundam. Inform., 2007

Decidability Problems of a Basic Class of Object Nets.
Fundam. Inform., 2007

Iteration Lemmata for Rational, Linear, and Algebraic Languages Over Algebraic Structures with Several Binary Operations.
Proceedings of the Formal Models, 2007

2006
On Quantum Vector Addition Systems.
Fundam. Inform., 2006

2005
Probability in Petri Nets.
Fundam. Inform., 2005

On Probabilistic Contextual Grammars.
Fundam. Inform., 2005

New Iteration Lemmata for Regular Languages.
Fundam. Inform., 2005

2004
A New Synchronisation Model for Multi-Level Object Petri Nets.
Fundam. Inform., 2004

On Languages of Cyclic Words.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Some Considerations on Higher-Order Petri Nets.
Fundam. Inform., 2003

On Universal Finite Automata and a-Transducers.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Homomorphic Characterizations of Linear and Algebraic Languages.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Multiple Pattern Interpretations.
Grammars, 2002

Closure Properties of Multiset Language Families.
Fundam. Inform., 2002

Nine Universal Circular Post Machines.
The Computer Science Journal of Moldova, 2002

Considerations on a Multiset Model for Membrane Computing.
Proceedings of the Membrane Computing, International Workshop, 2002

2001
w-Process Languages for Place/Transition Nets.
Fundam. Inform., 2001

On the Complexity of Propositional Calculus Formulae.
Sci. Ann. Cuza Univ., 2001

Small Universal Circular Post Machines.
The Computer Science Journal of Moldova, 2001

New Small Universal Circular Post Machines.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Universal Turing Machine with 3 States and 9 Symbols.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Rational, Linear and Algebraic Process Languages and Iteration Lemmata.
Fundam. Inform., 2000

Some results on the Collatz problem.
Acta Inf., 2000

Toward a Formal Macroset Theory.
Proceedings of the Multiset Processing, 2000

Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages.
Proceedings of the Multiset Processing, 2000

An Improvement of Iteration Lemmata for Context-free Languages.
Proceedings of the International Colloquium on Words, 2000

Special Factors of Traces.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Some Algebraic Structures with Iteration Lemmata.
J. UCS, 1999

Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages.
Fundam. Inform., 1999

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Bidirectional parsing for linear languages.
Proceedings of the Developments in Language Theory, 1999

1998
Algebraic, Linear and Rational Languages Defined by Mix Operation.
Fundam. Inform., 1998

1997
On Distributed Catenation.
Theor. Comput. Sci., 1997

Contextual Grammars with Distributed Catenation and Shuffle.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Mix Operation with Catenation and Shuffle.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Mix Operation.
Proceedings of the New Trends in Formal Languages, 1997

Calendars and Chronologies.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
Small Deterministic Turing Machines.
Theor. Comput. Sci., 1996

Morphological Grammars.
Sci. Ann. Cuza Univ., 1996

1995
Report on IFIP'94.
SIGACT News, 1995

Distributed Catenation and Chomsky Hierarchy.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Rational and Algebraic Languages with Distributed Catenation.
Proceedings of the Developments in Language Theory II, 1995

1993
General Formal Systems.
Proceedings of the Developments in Language Theory, 1993

1990
Comparison of basic language generating devices (non-deterministic systems).
ITA, 1990

1989
Deterministic Indian Parllel Systems.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

1987
Dyck1-Reductions of Context-free Languages.
Proceedings of the Fundamentals of Computation Theory, 1987

1984
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems.
Theor. Comput. Sci., 1984

1979
Context Free Normal Systems.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978
On a Reducing Operator for Combinatorial Systems
Information and Control, May, 1978

1977
Reducing Operators for Normed General Formal Systems.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1974
Comparing Several Ways of Context-Independent Parallel Rewriting.
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974

1973
Characterization of derivation sets of formal systems.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973


  Loading...