Publications of Oliver Matz
Publications at Chair of Computer Science 7
[MST02] |
O. Matz, N. Schweikardt, and W. Thomas.
The monadic quantifier alternation hierachy over grids and
graphs.
Information and Computation, 179:356-383, 2002. |
[Mat99] |
O. Matz.
Dot-depth and monadic quantifier elimination over pictures.
Technical Report AIB-99-08, RWTH Aachen, 1999. [ ps ] |
[Mat98c] |
O. Matz.
One quantifier will do in existential monadic second order logic
over grids.
In Proceedings of the 23rd International Symposium on
Mathematical Foundations of Computer Science, volume 1450 of Lecture
Notes in Computer Science, pages 751-759. Springer, 1998.
(c) Springer. [ ps ] |
[Mat98b] |
O. Matz.
On piecewise testable, starfree, and recognizabel picture
languages.
In Foundations of Software Science and Computation Structures,
volume 1378 of Lecture Notes in Computer Science, pages 203-210.
Springer, 1998.
(c) Springer. [ ps ] |
[Mat98a] |
O. Matz.
First order closure and the monadic second order alternation
hierachy.
Technical Report 9807, Christian-Albrechts-Universiät Kiel, 1998. [ ps ] |
[BMUV97] |
N. Buhrke, O. Matz, S. Ulbrand, and J. Vöge.
The automata theory package omega.
In Proceedings of the 2nd International Workshop on Implementing
Automata (WIA), volume 1436 of Lecture Notes in Computer Science,
pages 228-231. Springer, 1997.
(c) Springer. |
[Mat97] |
O. Matz.
Regular expressions and context-free grammars for picture
languages.
In Proceedings of the Symposium on Theoretical Aspects of
Computer Science, volume 1200 of Lecture Notes in Computer Science,
pages 283-294. Springer, 1997.
(c) Springer. [ ps ] |
[MT97] |
O. Matz and W. Thomas.
The monadic quantifier alternation hierachy over graphs is
infinite.
In Proceedings of the 12th Annual IEEE Symposium on Logic in
Computer Science, pages 236-244. IEEE, 1997. |
[Mat95] |
O. Matz.
Klassifizierung von Bildsprachen mit rationalen
Ausdrücken.
Diplomarbeit, Christian-Albrechts-Universität Kiel, 1995. |
[MMP+95] |
O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkema.
Report on the programm amore.
Technical Report 9507, Christian-Albrechts-Universiät Kiel, 1995. |
[MP95] |
O. Matz and A Potthoff.
Computing small nondeterministic finite automata.
In Tools and Algorithms for the Construction and analysis of
Systems, volume NS-95-s of BRICS Notes Series, pages 74-88, 1995. [ ps ] |