Publications


These selected publications (before 2005) are listed in reverse chronological order. Copies of papers will be provided upon request. Publications since 2005 can be found here.

Journal Articles

[1] M. Holzer and W. Holzer. TantrixTM Rotation Puzzles are Intractable. Discrete Applied Mathematics, 144(3):345-358, December 2004.
DOI  Abstract
[2] M. Holzer and B. König. On Deterministic Finite Automata and Syntactic Monoid Size. Theoretical Computer Science, 327(3):319-347, November 2004.
DOI  Abstract
[3] M. Holzer and St. Schwoon. Assembling Molecules in Atomix is Hard. Theoretical Computer Science, 313(3):447-462, February 2004.
DOI  Abstract
[4] H. Bordihn, M. Holzer, and M. Kutrib. Economy of Description for Basic Constructions on Rational Transductions. Journal of Automata, Languages and Combinatorics, 9(2/3):175-188, 2004.
[5] M. Holzer and M. Kutrib. Nondeterministic Descriptional Complexity of Regular Languages. International Journal of Foundations of Computer Science, 14(6):1087-1102, December 2003.
DOI  Abstract
[6] M. Holzer and P. McKenzie. Alternating and empty alternating auxiliary stack automata. Theoretical Computer Science, 299(1-3):307-326, April 2003.
DOI  Abstract
[7] M. Beaudry, M. Holzer, G. Niemann, and F. Otto. McNaughton Families of Languages. Theoretical Computer Science, 290:1581-1628, 2003.
DOI  Abstract
[8] C. Damm, M. Holzer, and P. McKenzie. The Complexity of Tensor Calculus. Computational Complexity, 11(1/2):54-89, January 2003.
DOI
[9] H. Fernau, R. Freund, and M. Holzer. Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes <=k and =k. Theoretical Computer Science, 299(1-3):633-662, 2003.
[10] H. Bordihn, H. Fernau, and M. Holzer. Accepting Pure Grammars. Publicationes Mathematicae Debrecen, 60(Supplementum):483-510, 2002.
[11] M. Holzer. Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. Theoretical Computer Science, 286:97-116, 2002.
DOI  Abstract
[12] H. Fernau, R. Freund, and M. Holzer. Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theoretical Computer Science, 259(1-2):405-426, May 2001.
[13] H. Bordihn and M. Holzer. On the Number of Active Symbols in L and CD Grammar Systems. Journal of Automata, Languages and Combinatorics, 6(4):411-426, 2001.
[14] M. Holzer, K. Salomaa, and S. Yu. On the State Complexity of k-Entry Deterministic Finite Automata. Journal of Automata, Languages and Combinatorics, 6(4):453-466, 2001.
[15] H. Bordihn and M. Holzer. Grammar Systems with Negated Conditions in Their Cooperation Protocols. Journal of Universal Computer Science, 6(12):1165-1184, 2000.
PDF  PS  Abstract
[16] H. Bordihn, H. Fernau, and M. Holzer. On Accepting Pure Lindenmayer Systems. Fundamenta Informaticae, 38:365-375, 1999.
[17] H. Bordihn and M. Holzer. On a hierarchy of languages generated by cooperating distributed grammar systems. Information Processing Letters, 69(2):59-62, January 1999.
DOI  Abstract
[18] H. Fernau and M. Holzer. Bidirectional coorperating distributed grammar systems. Publicationes Mathematicae Debrecen, 54(Supplementum):787-806, 1998.
[19] C. Damm, M. Holzer, and P. Rossmanith. Expressing Uniformity via Oracles. Theory of Computing Systems, 30(4):355-366, July 1997.
DOI  Abstract
[20] M. Holzer and P. Rossmanith. A simpler grammar for Fibonacci Numbers. The Fibonacci Quarterly, 34(5):465-466, November 1996.
[21] C. Damm and M. Holzer. Inductive Counting for Width-Restricted Branching Programs. Information and Computation, 130(1):91-99, October 1996.
DOI  Abstract
[22] H. Fernau, M. Holzer, and H. Bordihn. Accepting Multi-Agent Systems: The Case of Cooperating Distributed Grammar Systems. Journal of Computers and Artificial Intelligence, 15(2):123-139, 1996.
Abstract
[23] H. Fernau and M. Holzer. Accepting Multi-Agent Systems II. Acta Cybernetica-Selected Papers of the Workshop Grammars Systems: Recent Results and Perspectives, Budapest, July 1996, 12(4):361-379, 1996.

Books and Invited Papers

[1] M. Holzer and B. König. Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other. Bulletin of the European Association for Theoretical Computer Science, 83:139-155, June 2004.
[2] M. Holzer. Computational Complexity. In C. Martín-Vide and V. Mitrana, editors, Formal Languages and Applications, number 148 in Studies in Fuzziness and Soft Computing, pages 227-247. Springer, 2004.
[3] M. Holzer (editor). Workshop `{P}etrinetze' und 13. GI Theorietag `{A}utomaten und {F}ormale {S}prachen'. Technical Report TUM-I0322, Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei München, Germany, December 2003.
[4] M. Holzer. Aspects on the Descriptional Complexity of Finite Automata. In E. Csuhaj-Varjú, Ch. Kintala, D. Wotschke, and Gy. Vaszil, editors, Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems, pages 26-41, Budapest, Hungary, July 2003. MTA SZTAKI.
[5] W. Brauer, M. Holzer, B. König, and S. Schwoon. The Theory of Finite-State Adventures. Bulletin of the European Association for Theoretical Computer Science, 79:230-237, February 2003.
[6] H. Bordihn, H. Fernau, and M. Holzer. On Iterated Sequential Transducer. In C. Martin-Vide and V. Mitrana, editors, Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back, pages 121-130. Taylor and Francis, London, 2003.
[7] M. Holzer and P. McKenzie. On Auxiliary Pushdown and Stack Automata. SIGACT News, 33(1):32-35, March 2002.
[8] H. Bordihn and M. Holzer. On the Computational Complexity of Synchronized Context-Free Languages. Journal of Universal Computer Science, 8(2):119-140, 2002.
PDF  PS
[9] H. Fernau and M. Holzer. External Contextual and Conditional Languages. In C. Martin-Vide and Gh. Paun, editors, Recent Topics in Mathematical and Computational Linguistics, pages 104-120. Romanian Academy, Bucharest, June 2000.
[10] M. Holzer. Data-Independent Versus Data-Dependent Computations on Multi-Head Automata. Number 10 in Edition VERSAL. Bertz, December 1998.
[11] H. Fernau and M. Holzer. Conditional Context-Free Languages of Finite Index. In Gh. Paun and A. Salomaa, editors, New Trends in Formal Languages: Control, Cooperation, and Combinatorics, number 1218 in LNCS, pages 10-26. Springer, 1997.
[12] M. Holzer and K.-J. Lange. On the Complexity of Iterated Insertions. In Gh. Paun and A. Salomaa, editors, New Trends in Formal Languages: Control, Cooperation, and Combinatorics, number 1218 in LNCS, pages 440-453. Springer, 1997.
[13] M. Holzer (editor). 4. GI Theorietag `{A}utomaten und {F}ormale {S}prachen'. Technical Report WSI-95-10, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany, May 1995.

Conferences

[1] M. H. ter Beek, E. Csuhaj-Varjú, M. Holzer, and Gy. Vaszil. On Competence in CD Grammar Systems. In C. S. Calude, E. Calude, and M. J. Dinneen, editors, Proceedings of the 8th International Conference on Developments in Language Theory, number 3340 in LNCS, pages 76-88, Auckland, New Zealand, December 2004. Springer.
DOI  Abstract
[2] H. Bordihn, M. Holzer, and M. Kutrib. Input Reversals and Iterated Pushdown Automata-A New Characterization of Khabbaz Geometric Hierarchy of Languages. In C. S. Calude, E. Calude, and M. J. Dinneen, editors, Proceedings of the 8th International Conference on Developments in Language Theory, number 3340 in LNCS, pages 102-113, Auckland, New Zealand, December 2004. Springer.
DOI  Abstract
[3] M. Holzer and M. Kutrib. Register Complexity of LOOP-, WHILE-, and GOTO-Programs. In M. Margenstern, editor, Proceedings of the 4th International Conference Machines, Computations and Universality, number 3354 in LNCS, pages 233-244, St. Petersburg, Russia, September 2004. Springer.
DOI  Abstract
[4] M. Beaudry, J. M. Fernandez, and M. Holzer. A Common Algebraic Description for Probabilistic and Quantum Computation. In J. Fiala, V. Koubek, and J. Kratochvil, editors, Proceedings of the 29th Conference on Mathematical Foundations of Computer Science, number 3153 in LNCS, pages 851-862, Prague, Czech Republic, August 2004. Springer.
DOI  Abstract
[5] H. Bordihn, M. Holzer, and M. Kutrib. Some Non-Semi-Decidability Problems for Linear and Deterministic Context-Free Languages. In M. Domaratzki, A. Okhotin, K. Salomaa, and S. Yu, editors, Proceedings of the 9th International Conference Implementation and Application of Automata, number 3317 in LNCS, pages 68-79, Queen's University, Kingston, Ontario, Canada, July 2004. Springer.
DOI  Abstract
[6] H. Bordihn and M. Holzer. Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. In E. Csuhaj-Varjú and Gy. Vaszil, editors, Preliminary Proceedings of Grammar Systems Week, pages 66-82, Budapest, Hungary, July 2004. MTA SZTAKI.
[7] E. D. Demaine, M. Hoffmann, and M. Holzer. PushPush-k is PSPACE-Complete. In P. Ferragnia and R. Grossi, editors, Proceedings of the 3rd International Conference on FUN with Algorithms, pages 159-170, Island of Elba, Italy, May 2004. Edizioni Plus, Universitá di Pisa.
[8] M. Holzer, A. Klein, and M. Kutrib. On the NP-Completeness of the Nurikabe Pencil Puzzle and Variants Thereof. In P. Ferragnia and R. Grossi, editors, Proceedings of the 3rd International Conference on FUN with Algorithms, pages 77-89, Island of Elba, Italy, May 2004. Edizioni Plus, Universitá di Pisa.
[9] M. Holzer St. Schwoon. Reflections on Reflexion-Computational Complexity Considerations on a Puzzle Game. In P. Ferragnia and R. Grossi, editors, Proceedings of the 3rd International Conference on FUN with Algorithms, pages 90-105, Island of Elba, Italy, May 2004. Edizioni Plus, Universitá di Pisa.
[10] M. Holzer and B. König. Deterministic Finite Automata and Syntactic Monoid Size, Continued. In Z. Ésik and Z. Fülöp, editors, Proceedings of the 7th International Conference on Developments in Language Theory, number 2710 in LNCS, pages 349-360, Szeged, Hungary, July 2003. Springer.
[11] M. Holzer and M. Kutrib. Flip-Pushdown Automata: Nondeterminism is Better Than Determinism. In Z. Ésik and Z. Fülöp, editors, Proceedings of the 7th International Conference on Developments in Language Theory, number 2710 in LNCS, pages 361-372, Szeged, Hungary, July 2003. Springer.
[12] M. Holzer and M. Kutrib. State Complexity of Basic Operations on Nondeterministic Finite Automata. In J.-M. Champarnaud and D. Maurel, editors, Proceedings of the 7th International Conference Implementation and Application of Automata, number 2608 in LNCS, pages 148-157, Tours, France, July 2003. Springer.
[13] M. Holzer and M. Kutrib. Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Proceedings of the 30th International Colloqium on Automata, Languages and Propgramming, number 2719 in LNCS, pages 490-501, Eindhoven, The Netherlands, June-July 2003. Springer.
[14] M. Holzer and B. König. On Deterministic Finite Automata and Syntactic Monoid Size. In M. Ito and M. Toyama, editors, Proceedings of the 6th International Conference on Developments in Language Theory, number 2450 in LNCS, pages 258-269, Kyoto, Japan, September 2002. Springer.
[15] M. Holzer and M. Kutrib. Unary Language Operations and Their Nondeterministic State Complexity. In M. Ito and M. Toyama, editors, Proceedings of the 6th International Conference on Developments in Language Theory, number 2450 in LNCS, pages 162-172, Kyoto, Japan, September 2002. Springer.
[16] M. Beaudry and M. Holzer. The Complexity of Tensor Circuit Evaluation. In J. Sgall, A. Pultr, and P. Kolman, editors, Proceedings of the 26th Conference on Mathematical Foundations of Computer Science, number 2136 in LNCS, pages 173-185, Mariánské Lázne, Czech Republic, August 2001. Springer.
DOI  Abstract
[17] M. Beaudry, M. Holzer, G. Niemann, and F. Otto. On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. In W. Kuich, G. Rozenberg, and A. Salomaa, editors, Proceedings of the 5th International Conference Developments in Language Theory, number 2295 in LNCS, pages 340-348, Wien, Austria, July 2001. Springer.
[18] H. Fernau and M. Holzer. Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. In J. Dassow and D. Wotschke, editors, Proceedings of the 3rd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Preprint Nr. 16, pages 79-90, Wien, Austria, July 2001. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg.
[19] M. Holzer and M. Kutrib. Improving raster image run-length encoding using data order. In B. W. Watson and D. Wood, editors, Proceedings of the 6th International Conference on Implementation and Application of Automata, number 2494 in LNCS, pages 161-176, Pretoria, South Africa, July 2001. Springer.
[20] M. Holzer and W. Holzer. TantrixTM Rotation Puzzles are Intractable. In Proceedings of the 2nd International Conference FUN with Algorithms 2, pages 165-182, Island of Elba, Italy, May 2001. Carleton Scientific.
Abstract
[21] M. Holzer and P. McKenzie. Alternating and Empty Alternating Auxiliary Stack Automata. In M. Nielsen and B. Rovan, editors, Proceedings of the 25th Conference on Mathematical Foundations of Computer Science, number 1893 in LNCS, pages 415-425, Bratislava, Slovak Republic, August 2000. Springer.
Abstract
[22] H. Bordihn and M. Holzer. On the Number of Active Symbols in L and CD Grammar Systems. In O. Boldt and H. Jürgensen, editors, Pre-Proceedings of the Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Report No. 555, London, Ontario, Canada, July 2000. Department of Computer Science, The University of Western Onatario.
[23] C. Damm, M. Holzer, and P. McKenzie. The Complexity of Tensor Calculus. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 70-86, Florence, Italy, July 2000. IEEE Computer Society Press.
DOI
[24] M. Holzer, K. Salomaa, and S. Yu. On the State Complexity of k-Entry Deterministic Finite Automata. In O. Boldt and H. Jürgensen, editors, Pre-Proceedings of the Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Report No. 555, London, Ontario, Canada, July 2000. Department of Computer Science, The University of Western Onatario.
[25] H. Fernau, M. Holzer, and R. Freund. Cooperating Distributed Grammar Systems with Exhausting Resources. In R. Freund and A. Kelemenova, editors, Proceedings of the International Workshop Grammar Systems, pages 113-126, Bad Ischl, Austria, June 2000. Silesian University, Opava, Czech Republic.
[26] H. Bordihn and M. Holzer. Grammar Systems With Negated Conditions in Their Cooperation Protocols. In G. Rozenberg and W. Thomas, editors, Proceedings of the 4th International Conference Developments in Language Theory; Foundations, Applications, and Perspectives. World Scientific, 2000.
[27] M. Holzer. On fixed and general membership for external and internal contextual languages. In G. Rozenberg and W. Thomas, editors, Proceedings of the 4th International Conference Developments in Language Theory; Foundations, Applications, and Perspectives. World Scientific, 2000.
[28] H. Fernau, R. Freund, and M. Holzer. Regulated array grammars of finite index (Part I and II). In Gh. Paun and A. Salomaa, editors, Grammatical Models of Multi-Agent Systems, volume 8 of Topics in Computer Mathematics, pages 157-181,284-296. Gordon and Breach, December 1998.
[29] H. Fernau, R. Freund, and M. Holzer. Character recognition with k-head finite array automata. In Proceedings of the 7th International Workshop on Structural and Syntactic Pattern Recognition, number 1451 in LNCS, pages 282-291, Sydney, Australia, August 1998. Springer.
[30] R. Freund, H. Fernau, and M. Holzer. Representations of recursively enumerable array languages by d-dimensional contextual array grammars. In M. Margenstern, editor, MFCS'98 Satellite Workshop on Frontiers between Decidability and Undecidability, Brno, Czech Republic, August 1998.
[31] M. Holzer and M. Quenzer. VisA: Towards a Students' Green Card to Automata Theory and Formal Languages. In P. Strooper, editor, ACM Proceedings of the 3th Australasian Conference on Computer Science Education, pages 67-75, The Univeristy of Queensland, Brisbane, Australia, July 1998.
[32] H. Fernau, R. Freund, and M. Holzer. The Generative Power of d-Dimensional #-Context-Free Array Grammars. In M. Margenstern, editor, Proceedings of the 2nd International Colloquium Universal Machines and Computations, volume 2, pages 43-56, IUT de Metz, Université de Metz, Metz, France, March 1998.
[33] M. Holzer. Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. In I. Prívara and P. Ruzicka, editors, Proceedings of the 22nd Conference on Mathematical Foundations of Computer Science, number 1295 in LNCS, pages 299-308, Bratislava, Slovakia, August 1997. Springer.
DOI  Abstract
[34] H. Fernau, M. Holzer, and R. Freund. Bounding resources in cooperating distributed grammar systems. In S. Bozapalidis, editor, Proceedings of the 3rd International Conference Developments in Language Theory, pages 261-272, Aristotle University of Thessaloniki, Thessalomiki, Greece, July 1997.
[35] M. Holzer. On emptiness and counting for alternating finite automata. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II; at the Crossroads of Mathematics, Computer Science and Biology, pages 88-97. World Scientific, 1996.
[36] C. Damm and M. Holzer. Automata That Take Advice. In J. Wiedermann and P. Hájek, editors, Proceedings of the 20th Conference on Mathematical Foundations of Computer Science, number 969 in LNCS, pages 149-158, Prague, Czech Republic, August 1995. Springer.
DOI  Abstract
[37] C. Damm and M. Holzer. Inductive Counting below LOGSPACE. In I. Prívara and B. Rovan, editors, Proceedings of the 19th Conference on Mathematical Foundations of Computer Science, number 841 in LNCS, pages 276-285, Kosice, Slovakia, August 1994. Springer.
DOI  Abstract
[38] C. Damm, M. Holzer, K.-J. Lange, and P. Rossmanith. Deterministic 0L Languages Are of Very Low Complexity : D0L is in AC0. In Developments in Language Theory, pages 305-313. World Scientific, Singapore, 1994.
[39] C. Damm, M. Holzer, and P. Rossmanith. Expressing Uniformity via Oracles. In Developments In Theoretical Computer Science, Proceedings of the 7th International Meeting of Young Computer Scientists, pages 83-92, Smolonice Castle, Czechoslovakia, 1994. Gordon and Breach.
Abstract
[40] M. Holzer and K.-J. Lange. On the Complexities of Linear LL(1) and LR(1) Grammars. In Z. Ésik, editor, Proceedings of the 9th International Conference on Fundamentals of Computation Theory, number 710 in LNCS, pages 299-308, Szeged, Hungary, August 1993. Springer.
Abstract
[41] C. Damm, M. Holzer, and K.-J. Lange. The Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. In I. M. Havel and V. Koubek, editors, Proceedings of the 17th Conference on Mathematical Foundations of Computer Science, number 629 in LNCS, pages 227-235, Prague, Czechoslovakia, August 1992. Springer.
Abstract

Technical Reports

[1] M. Holzer and M. Kutrib. Flip-Pushdown Automata: Nondeterminism is Better Than Determinism. IFIG Research Report 0301, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, February 2003.
[2] M. Beaudry, J. M. Fernandez, and M. Holzer. A Common Algebraic Description for Probabilistic and Quantum Computations. Technical Report quant-ph/0212096, Los Alamos Preprint Archive, December 2002.
[3] M. Holzer and M. Kutrib. Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k. IFIG Research Report 0206, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, November 2002.
[4] M. Holzer and M. Kutrib. Nondeterministic Descriptional Complexity of Regular Languages. IFIG Research Report 0205, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, September 2002.
[5] H. Bordihn, M. Holzer, and M. Kutrib. Economy of Description for Basic Constructions on Rational Transductions. IFIG Research Report 0204, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, July 2002.
[6] M.H. ter Beek, E. Csuhaj-Varjú, M. Holzer, and Gy. Vaszil. On Competence in Cooperating Distributed Grammar Systems. Technical Report 2002/1, Research Group on Modelling Multi-Agent Systems, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, 2002.
[7] M.H. ter Beek, E. Csuhaj-Varjú, M. Holzer, and Gy. Vaszil. On Competence in Cooperating Distributed Grammar Systems, Part II. Technical Report 2002/2, Research Group on Modelling Multi-Agent Systems, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, 2002.
[8] M.H. ter Beek, E. Csuhaj-Varjú, M. Holzer, and Gy. Vaszil. On Competence in Cooperating Distributed Grammar Systems, Part III. Technical Report 2002/3, Research Group on Modelling Multi-Agent Systems, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, 2002.
[9] M. Holzer and M. Kutrib. Unary Language Operations and Their Nondeterministic State Complexity. IFIG Research Report 0107, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, November 2001.
[10] H. Bordihn, J. Dassow, and M. Holzer. Extending Regular Expressions with Homomorphic Replacement. Technischer Bericht TUM-I0102, Institut für Informatik, Technische Universität München, Arcisstraße 21, D-80290 München, Germany, August 2001.
[11] M. Holzer and M. Kutrib. Improving Raster Image Run-Length Encoding Using Data Order. IFIG Research Report 0105, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, July 2001.
[12] M. Holzer and St. Schwoon. Assembling Molecules in Atomix is Hard. Technischer Bericht TUM-I0101, Institut für Informatik, Technische Universität München, Arcisstraße 21, D-80290 München, Germany, May 2001.
[13] M. Holzer and M. Kutrib. State Complexity of Basic Operations on Nondeterministic Finite Automata. IFIG Research Report 0103, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany, April 2001.
[14] M. Beaudry, M. Holzer, G. Niemann, and F. Otto. McNaughton Languages. Mathematische Schriften Kassel, Preprint-Reihe Fachbereich Mathematik/Informatik 26/00, Universität Gesamthochschule Kassel, November 2000.
[15] C. Damm, M. Holzer, and P. McKenzie. The Complexity of Tensor Calculus. Report TR00-036, Electronic Colloquium on Computational Complexity (ECCC), June 2000.
[16] M. Holzer and W. Holzer. TantrixTM Rotation Puzzles are Intractable. Publication # 1164, Université de Montréal, Département d'informatique et de recherche opérationelle, C.P.6128, succ. Centre-ville, Montréal (Québec), H3C 3J7 Canada, October 1999.
[17] H. Bordihn and M. Holzer. Cooperating Distributed Grammar Systems with Non-Suceeding Components. Publication # 1143, Université de Montréal, Département d'informatique et de recherche opérationelle, C.P.6128, succ. Centre-ville, Montréal (Québec), H3C 3J7 Canada, February 1999.
[18] H. Bordihn, H. Fernau, and M. Holzer. Accepting Pure Grammar Systems. Preprint Nr. 1, Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, Postfach 4120, D-39016 Magdeburg, Germany, January 1999.
[19] H. Fernau and M. Holzer. Regulated Finite Index Language Families Collapse. Technical Report WSI-96-16, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany, May 1996.
[20] H. Fernau and M. Holzer. Bidirectional cooperation distributed grammar systems. Technical Report WSI-96-01, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany, February 1996.
[21] H. Fernau, R. Freund, and M. Holzer. External versus internal hybridization in cooperating distributed grammar systems. Technical Report TR 185-2/FR-1/96, Institut für Computersprachen, Technische Universität Wien, Resselgasse 3, A-1040 Wien, Austria, January 1996.
[22] L. Kászonyi and M. Holzer. On the Generalized Flip-Flop Lemma. Technical Report WSI-96-17, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany, 1996.
[23] C. Damm and M. Holzer. Automata That Take Advice. Technical Report WSI-95-14, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany, November 1995.
[24] C. Damm, M. Holzer, and P. Rossmanith. Expressing uniformity via oracles. Technical Report 95-01, Universiät Trier, Fachbereich IV - Mathematik/Informatik, Universität Trier, D-54286 Trier, Germany, January 1995.
[25] C. Damm and M. Holzer. Inductive Counting below LOGSPACE. Technical Report 94-12, Universiät Trier, Fachbereich IV - Mathematik/Informatik, Universität Trier, D-54286 Trier, Germany, October 1994.

Parts of this pages were generated by bibtex2thml.