Chronological List of Publications of Oliver Matz

[Mat95]

O. Matz. Klassifizierung von Bildsprachen mit rationalen Ausdrücken, Grammatiken und Logik-Formeln. Diploma thesis, Christian-Albrechts-Universität Kiel, 1995. (German). (PostScript)

[MMP+95]

Oliver Matz, Axel Miller, Andreas Potthoff, Wolfgang Thomas, and Erich Valkema. Report on the program amore. Technical Report 9507, Christian-Albrechts-Universität Kiel, 1995. (PostScript)

[MP95]

O. Matz and A. Potthoff. Computing small nondeterministic finite automata. In Tools and Algorithms for the Construction and Analysis of Systems -- TACAS 95, volume NS-95-2 of BRICS Notes Series, pages 74-88, 1995. (PostScript)

[BMUV97]

Nils Buhrke, Oliver Matz, Sascha Ulbrand, and Jens Vöge. The automata theory package omega. In Proceedings of WIA, volume 1436 of Lecture Notes in Computer Science. Springer, 1997. (PostScript)

[Mat97]

O. Matz. Regular expressions and context-free grammars for picture languages. In Rüdiger Reischuk and Michel Morvan, editors, Symposium on Theoretical Aspects of Computer Science 1997, volume 1200 of Lecture Notes in Computer Science, pages 283-294, Lübeck, 1997. BRICS, Springer. (PostScript)

[MT97]

O. Matz and W. Thomas. The monadic quantifier alternation hierarchy over graphs is infinite. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 236-244, Warsaw, Poland, 1997. IEEE. (PostScript)

[Mat98a]

O. Matz. First-order closure and the monadic second-order alternation hierarchy. Technical Report 9807, Institut für Informatik, Christian-Albrechts-Universität Kiel, 1998. (PostScript)

[Mat98b]

O. Matz. On piecewise testable, starfree, and recognizable picture languages. In Maurice Nivat, editor, Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 203-210. Springer, 1998. (PostScript)

[Mat98c]

O. Matz. One quantifier will do in existential monadic second-order logic over grids. In Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, The 23rd International Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 751-759. Springer, 1998. (PostScript)

[Mat99]

O. Matz. Dot-depth and monadic quantifier alternation over pictures. Technical Report 99-08, Rheinisch-Westfälischen Technischen Hochschule Aachen, 1999. (PostScript)

[MST02]

O. Matz, N. Schweikardt, and W. Thomas. The monadic quantifier alternation hierarchy over grids and graphs. Information and Computation, Vol 179 (2), 2002, pp 356--383, available at Science direct

[Mat07a]

O. Matz. A Kleene Theorem for Regular Picture Languages. Technical Report 0703, Christian-Albrechts-Universität Kiel, 2007, pdf download.

[Mat07b]

O. Matz. Recognizable vs. Regular Picture Languages. In Algebraic Informatics, volume 4728 of Lecture Notes in Computer Science. Springer, 2007. pdf download.