Bibliografía

Matthias Jantzen (nat. Höpner)

Coeditor

2008

Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, and Georg Zetzsche.
Petri net controlled finite automata.
Fundamenta Informaticae, 85(1-4):111-121, 2008.

Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
Language classes defined by concurrent finite automata.
Fundamenta Informaticae, 85(1-4):267-280, 2008.

Matthias Jantzen and Georg Zetzsche.
Labeled step sequences in Petri nets.
In Kees M. van Hee and Rüdiger Valk, editors, Applications and Theory of Petri Nets, 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008. Proceedings, volume 5062 of Lecture Notes in Computer Science, pages 270-287, Berlin, Heidelberg, New York, 2008. Springer-Verlag.

2007

Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, and Georg Zetzsche.
On concurrent finite automata.
In Ludwik Czaja, editor, Proceedings of the Workshop CS&P'2007, volume 1, pages 180-190, September 2007.

Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
Finite automata controlled by Petri nets.
In Stephan Philippi and Alexander Pini, editors, Proceedings of the 14th Workshop; Algorithmen und Werkzeuge für Petrinetze, number Technical Report Nr. 25/2007, pages 57-62. Univ. Koblenz-Landau, 2007.

Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
On languages accepted by concurrent finite automata.
In Ludwik Czaja, editor, Proceedings of the Workshop CS&P'2007, volume 2, pages 321-332, September 2007.

Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
Concurrent finite automata.
In Manfred Droste and Markus Lohrey, editors, Tagungsband 17. Theorietag Automaten und Formale Sprachen, pages 84-88, 2007.  [pdf]

2003

Matthias Jantzen and Alexy Kurganskyy.
Refining the hierarchy of Blind Multicounter languages and Twist-Closed Trios.
Information and Computation, 185(2):159-181, 2003.

Matthias Jantzen.
Intersecting multisets and applications to macrosets.
Bericht des Fachbereichs Informatik FBI-HH-B- 247/03, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 2003.  [pdf]

2001

Matthias Jantzen and Alexy Kurganskyy.
Refining the hierarchy of blind multicounter languages.
Bericht des Fachbereichs Informatik FBI-HH-B- 229/01, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 2001.

Matthias Jantzen and Alexy Kurganskyy.
Refining the hierarchy of blind multicounter languages.
In Afonso Ferreira and Horst Reichel, editors, Proceedings of the18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001, Dresden, Germany, February 15-17, 2001), volume 2010 of Lecture Notes in Computer Science, pages 376-387, Berlin, Heidelberg, New York, 2001. Springer-Verlag.

1998

Matthias Jantzen.
Hierarchies of principal twist-closed trios.
In Michel Morvan, Christoph Meinel, and Daniel Krob, editors, Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 98, Paris, France, February 25-27, 1998), volume 1373 of Lecture Notes in Computer Science, pages 344-355, Berlin, Heidelberg, New York, 1998. Springer-Verlag.

1997

Matthias Jantzen.
On twist-closed trios: a new morphic characterization of r.e. sets.
In Freksa et al. (ed.), Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, pages 135-142.

Matthias Jantzen.
On twist-closed trios.
Bericht des Fachbereichs Informatik FBI-HH-B- 204/97, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 1997.

Matthias Jantzen.
Basics of termrewriting.
In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages vol. III Beyond Words, pages 269-337, Berlin, Heidelberg, New York, 1997. Springer-Verlag.

1996

Matthias Jantzen.
5 Beiträge zum Wörterbuch der Kognitionswissenschaft.
In Gerhard Strube, Barbara Becker, Christian Freksa, Udo Hahn, Klaus Opwis, and Günther Palm, editors, Wörterbuch der Kognitionswissenschaft. Klett-Cotta Verlag, Stuttgart, 1996.

1994

Dirk Hauschildt and Matthias Jantzen.
Petri net algorithms in the theory of matrix grammars.
Bericht des Fachbereichs Informatik FBI-HH-B-167/94, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 1994.  [pdf]

D. Hauschildt and Matthias Jantzen.
Petri net algorithms in the theory of matrixgrammars.
Acta Informatica, (31):719-728, 1994.

Matthias Jantzen and Holger Petersen.
Cancellation in context-free languages: Enrichment by reduction.
Theoretical Computer Science, 127(1):149-170, 1994.

1993

Matthias Jantzen and Holger Petersen.
Cancellation in context-free languages: enrichment by reduction.
In Patrice Enjalbert, Alain Finkel, and Klaus W. Wagner, editors, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, (STACS 93, Würzburg, Germany, February 25-27, 1993), volume 665 of Lecture Notes in Computer Science, pages 206-215, Berlin, Heidelberg, New York, 1993. Springer-Verlag.

1992

Matthias Jantzen and Holger Petersen.
Cancellation in context-free languages: enrichment by reduction.
Bericht des Fachbereichs Informatik FBI-HH-B- 155/92, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 1992.

1991

Matthias Jantzen and Holger Petersen.
Twisting Petri net languages and how to obtain them by reducing linear context-free sets.
In Proceedings of the 12th International Conference on Application and Theory of Petri Nets (Gjern, Denmark, 1991), pages 228-236, Gjern, June 1991.

1989

Matthias Jantzen.
Synchronization operations and formal languages.
In A. Iványi, editor, Proceedings of Fifth Conference of Program Designers (Budapest, August 28 - September 1, 1989), volume 1, pages 15-26, Eötvös Loránd University Budapest, 1989.

1988

Matthias Jantzen.
Confluent String Rewriting, volume 14 of EATCS Monographs on Theoretical Computer Science.
Springer-Verlag, Berlin, Heidelberg, New York, 1988.

1987

Matthias Jantzen and Holger Petersen.
Petri net languages and one-sided Dyck-reductions on context-free sets.
In Klaus Voss, Hartmann J. Genrich, and Grzegorz Rozenberg, editors, Concurrency and Nets: Advances in Petri Nets (1986), Lecture Notes in Computer Science, pages 245-252, Berlin, Heidelberg, New York, 1987. Springer-Verlag.

Matthias Jantzen.
Complexity of place/transition nets.
In Wilfried Brauer, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets (1986) Part I, Proceedings of an Advanced Course, Bad Honnef, September 1986, volume 254 of Lecture Notes in Computer Science, pages 413-434, Berlin, Heidelberg, New York, 1987. Springer-Verlag.

Matthias Jantzen.
Language theory of Petri nets.
In Wilfried Brauer, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets (1986) Part I, Proceedings of an Advanced Course, Bad Honnef, September 1986, volume 254 of Lecture Notes in Computer Science, pages 397-412, Berlin, Heidelberg, New York, 1987. Springer-Verlag.

Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, and Holger Petersen.
Dyck-reductions of context-free languages.
In Lothar Budach and Oleg Borisovic Lupanov Rais Gatic Bukharajev, editors, Proceedings of Fundamentals of Computation Theory, International Conference (FCT'87, Kazan, USSR, June 22-26, 1987), volume 278 of Lecture Notes in Computer Science, pages 218-237. Springer-Verlag, 1987.

1986

Matthias Jantzen.
Confluent string rewriting and congruences.
EATCS-Bulletin, 28:52-72, 1986.
Section: Surveys and Tutorials.

1985

Matthias Jantzen.
A note on a special one-rule semi-Thue system.
Information Processing Letters, 21:135-140, 1985.

Matthias Jantzen.
Results on a (class of) special one-relator monoid(s).
In Jürgen Avenhaus and Klaus Madlener, editors, Proceedings of the workshop Combinatorial Algorithms in Algebraic Structures (Otzenhausen, 1985), pages 94-98, Otzenhausen, 1985. Fachbereich Informatik der Universität Kaiserslautern.

Rüdiger Valk and Matthias Jantzen.
The residue of vector sets with applications to decidability problems in Petri nets.
In Grzegorz Rozenberg, Hartmann Genrich, and Gérard Roucairol, editors, Advances in Petri Nets 1984 European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers, volume 188 of Lecture Notes in Computer Science, pages 234-258, Berlin, Heidelberg, New York, 1985. Springer-Verlag.

Matthias Jantzen.
Extending regular expressions with iterated shuffle.
Theoretical Computer Science, 38:223-247, 1985.

Rüdiger Valk and Matthias Jantzen.
The residue of vector sets with applications to decidability problems in Petri nets.
Acta Informatica 21, pages 643-674, 1985.  [pdf]

1984

Matthias Jantzen.
Extending regular expressions with iterated shuffle.
Bericht des Fachbereichs Informatik IFI-HH-B-99/84, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, January 1984.

Matthias Jantzen and Rüdiger Valk.
The residue of vector sets with applications to decidability problems in Petri nets.
Bericht des Fachbereichs Informatik FBI-HH-B-101/84, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, February 1984.

Matthias Jantzen.
Thue systems and the Church-Rosser property.
In Chytil. Michal and Václav Koubek, editors, Proceedings of Mathematical Foundations of Computer Science 1984, (MFCS'84, Praha, Czechoslovakia, September 3-7, 1984), volume 176 of Lecture Notes in Computer Science, pages 80-95, Berlin, Heidelberg, New York, 1984. Springer-Verlag.

Matthias Jantzen and Manfred Kudlek.
Homomorphic images of sentential form languages defined by semi-Thue systems.
Theoretical Computer Science, 33:13-43, 1984.

1983

Hendrik Bramhoff and Matthias Jantzen.
Durch Petrinetze definierte Klassen zahlentheoretischer Funktionen.
Institutsbericht IFI-HH-B-98/83, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 1983.

Matthias Jantzen and Rüdiger Valk.
The residue of vector sets with applications to decidability problems in Petri nets.
In Proceedings of the 4th European Workshop on Applications and Theory of Petri Nets, pages 342-363, Toulouse, France, 1983.

Matthias Jantzen and Rüdiger Valk.
A solution to problem 24(iii).
EATCS-Bulletin, 21:203-204, 1983.

Matthias Jantzen and Manfred Kudlek.
Homomorphic images of sentential form languages defined by semi-Thue systems.
Bericht des Fachbereichs Informatik FBI-HH-B-89/83, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, February 1983.

1982

Hendrik Bramhoff and Matthias Jantzen.
Notions of computability by Petri nets.
In Anastasia Pagnoni and Grzegorz Rozenberg, editors, Proceedings of the 3rd European Workshop on Applications and Theory of Petri Nets (Varenna, Italy, September 27-30, 1982), volume 66 of Lecture Notes in Computer Science, pages 149-166, Berlin, Heidelberg, New York, 1983. Springer-Verlag.

Matthias Jantzen.
Semi-Thue systems and generalized Church-Rosser properties.
In Dominique Perrin, editor, Acte des journées Fête Des Mots (Rouen, 7.-8. Juin 1982), volume 26, pages 60-75, Rouen, France, 1982. La Société Mathematique de France et le GRECO de Programmation.

Matthias Jantzen.
Semi-Thue systems and generalized Church-Rosser properties.
Institutsbericht IFI-HH-B-92/82, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, 1982.

Matthias Jantzen and Manfred Kudlek.
Homomorphic images of sentential form languages defined by semi-Thue systems.
In M. Joseph and R. K. Nerasimhan, editors, Proceedings of the 2nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'82, Bangalore, India, December 13-15, 1982), pages 126-135, Bombay, India, 1982. National Centre for Software Development and Computing Techniques, Tata Institute of Fundamental Research, Colaba, Bombay.

Ronald V. Book, Matthias Jantzen, and Celia Wrathall.
Monadic Thue systems.
Theoretical Computer Science, 19:231-251, 1982.

1981

Matthias Jantzen and Manfred Opp.
A normal form theorem for label grammars.
Mathematical Systems Theory, 14(1):289-303, 1981.

Matthias Jantzen.
On a special monoid with a single definig relation.
Theoretical Computer Science, 16:61-73, 1981.

Matthias Jantzen.
On shuffle and iterated shuffle.
In Jean-Michel Autebert, Jofroy Beauquier, and Luc Boasson, editors, Actes de l'Ecole de Printemps de Theory des Languages (Murol, France, Mars 1982), Proceedings of the 9th Springschool, L.I.T.P. report, pages 216-234, Murol, France, 1981. L.I.T.P.

C. O. Du'nlaing, Matthias Jantzen, and B. Monien.
On the complexity of word problems in certain Thue systems.
In Mathematical Foundations of Computer Science. Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 - September 4, 1981, volume 118 of Lecture Notes in Computer Science, pages 216-251, Berlin, Heidelberg, New York, 1981. Springer-Verlag.

R. V. Book, Matthias Jantzen, and C. Wrathall.
(Erasing)* strings.
In Theoretical Computer Science. 5th GI-Conference Karlsruhe, March 23-25, 1981, volume 104 of Lecture Notes in Computer Science, pages 252-259, Berlin, Heidelberg, New York, 1981. Springer-Verlag.

Matthias Jantzen.
The power of synchronizing operations on strings.
Theoretical Computer Science, 14:127-154, 1981.

1980

Matthias Jantzen.
A note on iterating inverse homomorphisms.
EATCS-Bulletin, 12:62-64, 1980.

Matthias Jantzen.
The power of synchronizing operations on strings.
Technical Report Institutsbericht IFI-HH-B-67/80, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, March 1980.

Matthias Jantzen.
Structured representation of knowledge by Petri nets as an aid for teaching and research.
In Brauer (ed.), Net Theory and Applications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979, pages 507-516.

Matthias Jantzen.
On a special monoid with a single definig relation.
Research in computer science, Dept. of Mathematics, Univ. of California at Santa Barbara, USA, January 1980.

Matthias Jantzen.
On a special monoid with a single definig relation.
Institutsbericht IFI-HH-B-68/80, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, April 1980.

R. V. Book, Matthias Jantzen, and C. Wrathall.
Monadic Thue systems.
Research in computer science, Dept. of Mathematics, Univ. of California at Santa Barbara, USA, 1980.

Matthias Jantzen and Rüdiger Valk.
Formal properties of place/transition nets.
In Brauer (ed.), Net Theory and Applications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979, pages 165-212.

1979

Matthias Jantzen and Rüdiger Valk.
Formal properties of place transition nets.
In Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979.

Matthias Jantzen.
On the hierarchy of Petri net languages.
R.A.I.R.O. Informatique théorique/Theoretical Informatics, 13(1):19-30, 1979.

Matthias Jantzen.
A note on vector grammars.
Information Processing Letters, 8(1):32-33, 1979.

Matthias Jantzen.
On zerotesting-bounded multicounter machines.
In Klaus Weihrauch, editor, Proceedings of the 4th GI Conference Theoretical Computer Science (Aachen, March 26-28, 1979), volume 67 of Lecture Notes in Computer Science, pages 158-169, Berlin, Heidelberg, New York, 1979. Springer-Verlag.

Matthias Jantzen.
Eigenschaften von Petrinetzsprachen.
Technical Report Institutsbericht IFI-HH-B-64/79, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, November 1979.

Matthias Jantzen.
Eigenschaften von Petrinetzsprachen.
Dissertation, Universität Hamburg, Fachbereich Informatik, 1979.
Dissertation, Fachbereich Informatik, Universität Hamburg.

Matthias Jantzen.
Structured representation of knowledge by Petri nets as an aid for teaching and research.
In Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979.

1977

Matthias Jantzen and Manfred Opp.
Renaming and erasing in szilard languages.
Institutsbericht IFI-HH-B-35/77, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, May 1977.
The author Jantzen published under his birthname Höpner until September 1977.

Matthias Jantzen and Manfred Opp.
Renaming and erasing in szilard languages.
In Arto Salomaa and Magnus Steinby, editors, Proceedings of the Fourth International Colloquium on Automata, Languages and Programming (ICALP'77, University of Turku, Finland, July 18-22, 1977), volume 52 of Lecture Notes in Computer Science, pages 244-257, Berlin, Heidelberg, New York, 1977. Springer-Verlag.
The author Jantzen published under his birthname Höpner until September 1977.

1976

Matthias Jantzen and Manfred Opp.
About three equational classes of languages built up by shuffle operations.
In Antoni Mazurkiewicz, editor, Proceedings of the 5th Symposium Mathematical Foundations of Computer Science (MFCS'76, Gdansk, 6.-10. September, 1976), volume 45 of Lecture Notes in Computer Science, pages 337-344, Berlin, Heidelberg, New York, 1976. Springer-Verlag.
The author Jantzen published under his birthname Höpner until September 1977.

1974

Matthias Jantzen.
Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken.
Diplomarbeit, Universität Hamburg, Fachbereich Informatik, Institut für Informatik, Univ. Hamburg, 1974.
The author Jantzen published under his birthname Höpner until September 1977.

Matthias Jantzen.
Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken.
Institutsbericht IFI-HH-B-12/74, Institut für Informatik, Universität Hamburg, lagernd am Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, August 1974.
The author Jantzen published under his birthname Höpner until September 1977.

Matthias Jantzen.
Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen.
In Dirk Siefkes, editor, Proceedings of the 4. Jahrestagung GI (Berlin, 9.-12. Oktober, 1974), volume 26 of Lecture Notes in Computer Science, pages 113-122, Berlin, Heidelberg, New York, 1974. Springer-Verlag.
The author Jantzen published under his birthname Höpner until September 1977.

Coeditor de

1997

Christian Freksa, Matthias Jantzen, and Rüdiger Valk, editors.
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, volume 1337 of Lecture Notes in Computer Science.
Springer-Verlag, Berlin, Heidelberg, New York, 1997.