Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen. - Matthias Höpner (GI Jahrestagung, 1974)

About Three Equations Classes of Languages Built Up By Shuffle Operations. - Matthias Höpner; Manfred Opp (MFCS, 1976)

Renaming and Erasing in Szilard Languages. - Matthias Höpner; Manfred Opp (ICALP, 1977)

Structured Representation of Knowledge by Petri Nets as an Aid for Teaching and Research. - Matthias Jantzen (Advanced Course: Net Theory and Applications, 1979)

Formal Properties of Place/Transition Nets. - Matthias Jantzen; Rüdiger Valk (Advanced Course: Net Theory and Applications, 1979)

On Zerotesting-Bounded Multicounter Machines. - Matthias Jantzen (Theoretical Computer Science, 1979)

A Note on Vector Grammars. - Matthias Jantzen (Inf. Process. Lett., 1979)

On the hierarchy of Petri net languages. - Matthias Jantzen (RAIRO Theor. Informatics Appl., 1979)

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). - Ronald V. Book; Matthias Jantzen; Burkhard Monien; Colm Ó'Dúnlaing; Celia Wrathall (MFCS, 1981)

(Erasing)* Strings. - Ronald V. Book; Matthias Jantzen; Celia Wrathall (Theoretical Computer Science, 1981)

A Normal Form Theorem for Label Grammars. - Matthias Jantzen; Manfred Opp (Math. Syst. Theory, 1981)

The Power of Synchronizing Operations on Strings. - Matthias Jantzen (Theor. Comput. Sci., 1981)

On a Special Monoid with a Single Defining Relation. - Matthias Jantzen (Theor. Comput. Sci., 1981)

Notions of Computability by Petri Nets. - Matthias Jantzen; Hendrik Bramhoff (European Workshop on Applications and Theory of Petri Nets, 1982)

Monadic Thue Systems. - Ronald V. Book; Matthias Jantzen; Celia Wrathall (Theor. Comput. Sci., 1982)

Thue Systems and the Church-Rosser Property. - Matthias Jantzen (MFCS, 1984)

Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems. - Matthias Jantzen; Manfred Kudlek (Theor. Comput. Sci., 1984)

The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. - Rüdiger Valk; Matthias Jantzen (Acta Informatica, 1985)

A Note on a Special One-Rule Semi-Thue System. - Matthias Jantzen (Inf. Process. Lett., 1985)

Extending Regular Expressions with Iterated Shuffle. - Matthias Jantzen (Theor. Comput. Sci., 1985)

Language Theory of Petri Nets. - Matthias Jantzen (Advances in Petri Nets, 1986)

Complexity of Place/Transition Nets. - Matthias Jantzen (Advances in Petri Nets, 1986)

Dyck1-Reductions of Context-free Languages. - Matthias Jantzen; Manfred Kudlek; Klaus-Jörn Lange; Holger Petersen 001 (FCT, 1987)

Confluent String Rewriting - Matthias Jantzen (Springer, 1988)

Petri Net Algorithms in the Theory of Matrix Grammars. - Dirk Hauschildt; Matthias Jantzen (Acta Informatica, 1994)

Cancellation in Context-Free Languages: Enrichment by Reduction. - Matthias Jantzen; Holger Petersen 001 (Theor. Comput. Sci., 1994)

On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets. - Matthias Jantzen (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Basics of Term Rewriting. - Matthias Jantzen (Handbook of Formal Languages (3), 1997)

Hierarchies of Principal Twist-Closed Trios. - Matthias Jantzen (STACS, 1998)

Refining the Hierarchy of Blind Multicounter Languages. - Matthias Jantzen; Alexy Kurganskyy (STACS, 2001)

Refining the hierarchy of blind multicounter languages and twist-closed trios. - Matthias Jantzen; Alexy Kurganskyy (Inf. Comput., 2003)

Labeled Step Sequences in Petri Nets. - Matthias Jantzen; Georg Zetzsche (Petri Nets, 2008)

Petri Net Controlled Finite Automata. - Berndt Farwer; Matthias Jantzen; Manfred Kudlek; Heiko Rölke; Georg Zetzsche (Fundam. Informaticae, 2008)

Language Classes Defined by Concurrent Finite Automata. - Matthias Jantzen; Manfred Kudlek; Georg Zetzsche (Fundam. Informaticae, 2008)