Manfred Kudlek

Nils Erik Flick

Fundam. Informaticae, 2014

2013

A Hierarchy of Languages with Catenation and Shuffle.

[BibT_eX]

[DOI]

Nils Erik Flick

Fundam. Informaticae, 2013

2012

Report on CS&P 2011.

[BibT_eX]

[DOI]

Bull. EATCS, 2012

Report on AFL 2011.

[BibT_eX]

[DOI]

Bull. EATCS, 2012

Language Operators for Multiset Languages and Modal Logic.

[BibT_eX]

Nils Erik Flick

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

2011

A Relation between Modal Logic and Language Closure Operators.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

On Synthesis and Analysis of Generalized Work Flow Net Structures and Transition Graphs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

On the Existence of Universal Finite or Pushdown Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

2010

On Hamblin's 15 Tense Theorem.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2010

A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.

[BibT_eX]

[DOI]

Sándor Horváth

J. Autom. Lang. Comb., 2010

Synthesis and Analysis of Net Structures and Transition Graphs with Inhibitor Relations.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2009

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata.

[BibT_eX]

[DOI]

Patrick Totzke

Georg Zetzsche

Fundam. Informaticae, 2009

Multiset Pushdown Automata.

[BibT_eX]

[DOI]

Patrick Totzke

Georg Zetzsche

Fundam. Informaticae, 2009

Analysis and Synthesis of Net Structures and Transition Graphs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

2008

Linear Properties of Zero-Safe Nets with Debit Tokens.

[BibT_eX]

[DOI]

Michael Köhler-Bußmeier

Fundam. Informaticae, 2008

Language Classes Defined by Concurrent Finite Automata.

[BibT_eX]

[DOI]

Matthias Jantzen

Georg Zetzsche

Fundam. Informaticae, 2008

Petri Net Controlled Finite Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Some Considerations on Universality

[BibT_eX]

[DOI]

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

2007

Some Remarks on Quantum Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

On Semilinear Sets over Commutative Semirings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Concurrent Turing Machines.

[BibT_eX]

[DOI]

Berndt Farwer

Heiko Rölke

Fundam. Informaticae, 2007

Decidability Problems of a Basic Class of Object Nets.

[BibT_eX]

[DOI]

Roxana Dietze

Olaf Kummer

Fundam. Informaticae, 2007

Iteration Lemmata for Rational, Linear, and Algebraic Languages Over Algebraic Structures with Several Binary Operations.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

On Quantum Vector Addition Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2005

Probability in Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

On Probabilistic Contextual Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

New Iteration Lemmata for Regular Languages.

[BibT_eX]

[DOI]

Pál Dömösi

Fundam. Informaticae, 2005

2004

A New Synchronisation Model for Multi-Level Object Petri Nets.

[BibT_eX]

[DOI]

Berndt Farwer

Fundam. Informaticae, 2004

On Languages of Cyclic Words.

[BibT_eX]

[DOI]

Proceedings of the Aspects of Molecular Computing, 2004

2003

Some Considerations on Higher-Order Petri Nets.

[BibT_eX]

[DOI]

Berndt Farwer

Kundan Misra

Fundam. Informaticae, 2003

On Universal Finite Automata and a-Transducers.

[BibT_eX]

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Homomorphic Characterizations of Linear and Algebraic Languages.

[BibT_eX]

Virgil Emil Cazanescu

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

Multiple Pattern Interpretations.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Grammars, 2002

Closure Properties of Multiset Language Families.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Nine Universal Circular Post Machines.

[BibT_eX]

[DOI]

Artiom Alhazov

Iurie Rogojin

Comput. Sci. J. Moldova, 2002

Considerations on a Multiset Model for Membrane Computing.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2002

2001

w-Process Languages for Place/Transition Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

On the Complexity of Propositional Calculus Formulae.

[BibT_eX]

[DOI]

Sci. Ann. Cuza Univ., 2001

Small Universal Circular Post Machines.

[BibT_eX]

[DOI]

Iurie Rogojin

Comput. Sci. J. Moldova, 2001

New Small Universal Circular Post Machines.

[BibT_eX]

[DOI]

Yurii Rogozhin

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Universal Turing Machine with 3 States and 9 Symbols.

[BibT_eX]

[DOI]

Yurii Rogozhin

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Rational, Linear and Algebraic Process Languages and Iteration Lemmata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Some results on the Collatz problem.

[BibT_eX]

[DOI]

Stefan Andrei

Radu Stefan Niculescu

Acta Informatica, 2000

Toward a Formal Macroset Theory.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Gheorghe Paun

Proceedings of the Multiset Processing, 2000

Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages.

[BibT_eX]

[DOI]

Proceedings of the Multiset Processing, 2000

An Improvement of Iteration Lemmata for Context-free Languages.

[BibT_eX]

Pál Dömösi

Proceedings of the International Colloquium on Words, 2000

Special Factors of Traces.

[BibT_eX]

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

Some Algebraic Structures with Iteration Lemmata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.

[BibT_eX]

[DOI]

Pál Dömösi

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Bidirectional parsing for linear languages.

[BibT_eX]

[DOI]

Stefan Andrei

Proceedings of the Developments in Language Theory, 1999

1998

Algebraic, Linear and Rational Languages Defined by Mix Operation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

1997

On Distributed Catenation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Contextual Grammars with Distributed Catenation and Shuffle.

[BibT_eX]

[DOI]

Solomon Marcus

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Mix Operation with Catenation and Shuffle.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Mix Operation.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

Calendars and Chronologies.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

Small Deterministic Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Morphological Grammars.

[BibT_eX]

Stefan Andrei

Sci. Ann. Cuza Univ., 1996

1995

Report on IFIP'94.

[BibT_eX]

[DOI]

SIGACT News, 1995

Distributed Catenation and Chomsky Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Rational and Algebraic Languages with Distributed Catenation.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

A Mathematical Model of Personal Pronouns.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

General Formal Systems.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1990

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1990

1989

Deterministic Indian Parllel Systems.

[BibT_eX]

[DOI]

Proceedings of the A Perspective in Theoretical Computer Science, 1989

1987

Dyck<sub>1</sub>-Reductions of Context-free Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1987

1984

Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems.

[BibT_eX]

[DOI]

Matthias Jantzen

Theor. Comput. Sci., 1984

1979

Context Free Normal Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

On a Reducing Operator for Combinatorial Systems

[BibT_eX]

[DOI]

Miroslav Novotný

Inf. Control., May, 1978

1977

Reducing Operators for Normed General Formal Systems.

[BibT_eX]

[DOI]

Miroslav Novotný

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1974

Comparing Several Ways of Context-Independent Parallel Rewriting.

[BibT_eX]

[DOI]

Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974

1973

Characterization of derivation sets of formal systems.

[BibT_eX]

[DOI]