| 2008 |
|---|
| 34 | EE | Matthias Jantzen,
Georg Zetzsche:
Labeled Step Sequences in Petri Nets.
Petri Nets 2008: 270-287 |
| 33 | EE | Berndt Farwer,
Matthias Jantzen,
Manfred Kudlek,
Heiko Rölke,
Georg Zetzsche:
Petri Net Controlled Finite Automata.
Fundam. Inform. 85(1-4): 111-121 (2008) |
| 32 | EE | Matthias Jantzen,
Manfred Kudlek,
Georg Zetzsche:
Language Classes Defined by Concurrent Finite Automata.
Fundam. Inform. 85(1-4): 267-280 (2008) |
| 2003 |
|---|
| 31 | EE | Matthias Jantzen,
Alexy Kurganskyy:
Refining the hierarchy of blind multicounter languages and twist-closed trios.
Inf. Comput. 185(2): 159-181 (2003) |
| 2001 |
|---|
| 30 | EE | Matthias Jantzen,
Alexy Kurganskyy:
Refining the Hierarchy of Blind Multicounter Languages.
STACS 2001: 376-387 |
| 1998 |
|---|
| 29 | | Matthias Jantzen:
Hierarchies of Principal Twist-Closed Trios.
STACS 1998: 344-355 |
| 1997 |
|---|
| 28 | | Christian Freksa,
Matthias Jantzen,
Rüdiger Valk:
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Springer 1997 |
| 27 | EE | Matthias Jantzen:
On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 135-142 |
| 1994 |
|---|
| 26 | | Dirk Hauschildt,
Matthias Jantzen:
Petri Net Algorithms in the Theory of Matrix Grammars.
Acta Inf. 31(8): 719-728 (1994) |
| 25 | | Matthias Jantzen,
Holger Petersen:
Cancellation in Context-Free Languages: Enrichment by Reduction.
Theor. Comput. Sci. 127(1): 149-170 (1994) |
| 1993 |
|---|
| 24 | | Matthias Jantzen,
Holger Petersen:
Cancellation on Context-Free Languages: Enrichment by Reduction.
STACS 1993: 206-215 |
| 1992 |
|---|
| 23 | | Alain Finkel,
Matthias Jantzen:
STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings
Springer 1992 |
| 1991 |
|---|
| 22 | | Christian Choffrut,
Matthias Jantzen:
STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings
Springer 1991 |
| 1987 |
|---|
| 21 | | Matthias Jantzen,
Manfred Kudlek,
Klaus-Jörn Lange,
Holger Petersen:
Dyck1-Reductions of Context-free Languages.
FCT 1987: 218-227 |
| 1986 |
|---|
| 20 | | Matthias Jantzen:
Language Theory of Petri Nets.
Advances in Petri Nets 1986: 397-412 |
| 19 | | Matthias Jantzen:
Complexity of Place/Transition Nets.
Advances in Petri Nets 1986: 413-434 |
| 1985 |
|---|
| 18 | | Rüdiger Valk,
Matthias Jantzen:
The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets.
Acta Inf. 21: 643-674 (1985) |
| 17 | | Matthias Jantzen:
A Note on a Special One-Rule Semi-Thue System.
Inf. Process. Lett. 21(3): 135-140 (1985) |
| 16 | | Matthias Jantzen:
Extending Regular Expressions with Iterated Shuffle.
Theor. Comput. Sci. 38: 223-247 (1985) |
| 1984 |
|---|
| 15 | | Rüdiger Valk,
Matthias Jantzen:
The residue of vector sets with applications to decidability problems in Petri nets.
European Workshop on Applications and Theory in Petri Nets 1984: 234-258 |
| 14 | | Matthias Jantzen:
Thue Systems and the Church-Rosser Property.
MFCS 1984: 80-95 |
| 13 | | Matthias Jantzen,
Manfred Kudlek:
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems.
Theor. Comput. Sci. 33: 13-43 (1984) |
| 1982 |
|---|
| 12 | | Matthias Jantzen,
Hendrik Bramhoff:
Notions of Computability by Petri Nets.
European Workshop on Applications and Theory of Petri Nets 1982: 149-165 |
| 11 | | Ronald V. Book,
Matthias Jantzen,
Celia Wrathall:
Monadic Thue Systems.
Theor. Comput. Sci. 19: 231-251 (1982) |
| 1981 |
|---|
| 10 | | Ronald V. Book,
Matthias Jantzen,
Burkhard Monien,
Colm Ó'Dúnlaing,
Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
MFCS 1981: 216-223 |
| 9 | | Ronald V. Book,
Matthias Jantzen,
Celia Wrathall:
(Erasing)* Strings.
Theoretical Computer Science 1981: 252-259 |
| 8 | | Matthias Jantzen,
Manfred Opp:
A Normal Form Theorem for Label Grammars.
Mathematical Systems Theory 14: 289-303 (1981) |
| 7 | | Matthias Jantzen:
The Power of Synchronizing Operations on Strings.
Theor. Comput. Sci. 14: 127-154 (1981) |
| 6 | | Matthias Jantzen:
On a Special Monoid with a Single Defining Relation.
Theor. Comput. Sci. 16: 61-73 (1981) |
| 1979 |
|---|
| 5 | | Matthias Jantzen:
On Zerotesting-Bounded Multicounter Machines.
Theoretical Computer Science 1979: 158-169 |
| 4 | | Matthias Jantzen:
On the hierarchy of Petri net languages.
ITA 13(1): (1979) |
| 3 | | Matthias Jantzen:
A Note on Vector Grammars.
Inf. Process. Lett. 8(1): 32-33 (1979) |
| 1975 |
|---|
| 2 | | Matthias Jantzen,
Rüdiger Valk:
Formal Properties of Place/Transition Nets.
Advanced Course: Net Theory and Applications 1975: 165-212 |
| 1 | | Matthias Jantzen:
Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research.
Advanced Course: Net Theory and Applications 1975: 507-517 |
