Professional Activities

Chairman of the Working Group "Automaten und Formale Sprachen" of the German Computer Science Society GI (Gesellschaft für Informatik)

Member of the IFIP Working Group on "Cellular Automata and Discrete Complex Systems"

Member of the Editorial Board of Journal of Cellular Automata

Honorary Editor of International Journal of Unconventional Computing

Guest Editor of the special issue IEICE Transactions on Information and Systems E87-D(3), 2004

Guest Editor of the special issue Fundamenta Informaticae 58(3), 2003

Guest Editor of the special issue Parallel Computing 23(11), 1997

Member of "Direktorium des Instituts für Informatik"

Member of "Fachbereichsrat des Fachbereichs Mathematik und Informatik, Physik, Geographie"

Organization of Workshops and Conferences

Workshop on Non-Classical Models of Automata and Applications (NCMA 2009)

18. GI-Theorietag, Automaten und Formale Sprachen, 2008

FORMAT-Workshop Sommer 2004

FORMAT-Workshop in cooperation with IFIP Working Group 1.2

International IFIP Cellular Automata Workshop

Interdisziplinärer Workshop: "Informatik an der JLUG"

5. GI-Theorietag, Automaten und Formale Sprachen

Recent Talks (1998-)

Cellular Automata and Language Theory, International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2009), São José dos Campos, Brazil, October 2009

Cellular Automata With Sparse Communication, Conference on Implementation and Application of Automata (CIAA 2009), Sydney, Australia, July 2009

Undecidability of Operation Problems for T0L Languages and Subclasses, Language and Automata Theory and Applications (LATA 2009), Tarragona, Spain, April 2009

Descriptional Complexity of Restarting Automata, ABCDays on List Automata, Forgetting Automata, and Restarting Automata, Prague, Czech Republic, March 2009

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems Subregular Language Families, The Complexity of Simple Programs (CSP 2008), Cork, Ireland, December 2008

State Complexity of NFA to DFA Conversion for Subregular Language Families, Descriptional Complexity of Formal Systems (DCFS 2008), Charlottetown, Prince Edward Island, Canada, July 2008

Real-Time Reversible Language Recognition by Cellular Automata, Theory and Applications of Cellular Automata (AUTOMATA 2008), Bristol, UK, June 2008

Real-Time Reversible Iterative Arrays, Fundamentals of Computation Theory (FCT 2007), Budapest, Hungary, August 2007

Optimal Simulations of Weak Restarting Automata, Descriptional Complexity of Formal Systems (DCFS 2007), High Tatras, Slovakia, July 2007

Hairpin Finite Automata, Developments in Language Theory (DLT 2007), Turku, Finland, July 2007

Fast Reversible Language Recognition Using Cellular Automata, Language and Automata Theory and Applications (LATA 2007), Tarragona, Spain, April 2007

Succinct Description of Regular Languages by Weak Restarting Automata, Language and Automata Theory and Applications (LATA 2007), Tarragona, Spain, April 2007

Fast Iterative Arrays with Restricted Inter-Cell Communication: Computational Capacity, 16. GI-Theorietag, Automaten und Formale Sprachen, Vienna, Austria, September 2006

Computational Capacity and Descriptional Complexity of Communication-Restricted Cellular Automata, International Workshop on Unconventional Computing and Cellular Automata, Hiroshima, Japan, September 2006

Fast Iterative Arrays with Restricted Inter-Cell Communication: Computational Capacity, IFIP International Conference on Theoretical Computer Science (IFIP TCS2006). IFIP World Computer Congress, Santiago de Chile, Chile, August 2006

Finite Turns and the Regular Closure of Linear Languages, 15. GI-Theorietag, Automaten und Formale Sprachen, Lauterbad, September 2005

Fast Iterative Arrays with Restricted Inter-Cell Communication: Computational Capacity, International Workshop on Cellular Automata, Gdansk, Poland, September 2005

Revolving-Input Finite Automata, Developments in Language Theory (DLT 2005), Palermo, Italy, July 2005

Descriptional Complexity of Deterministic Restarting Automata, Descriptional Complexity of Formal Systems (DCFS 2005), Como, Italy, June 2005

Finite Turns and the Regular Closure of Linear Languages, FORMAT-Workshop, Würzburg, November 2005

The Boolean Closure of Linear Context-Free Languages, Developments in Language Theory VIII (DLT 2004), Auckland, New Zealand, December 2004

Flip-Pushdown Automata, FORMAT-Workshop, Kassel, November 2004

Register Complexity of LOOP-, WHILE-, and GOTO-Programs, 14. GI-Theorietag, Automaten und Formale Sprachen, Caputh, September 2004

Register Complexity of LOOP-, WHILE-, and GOTO-Programs, Machines, Computations and Universality (MCU 2004), St. Petersburg, Russia, September 2004

The Phenomenon of Non-Recursive Trade-Offs, Descriptional Complexity of Formal Systems (DCFS 2004), London, Ontario, Canada, July 2004

Some Non-Semi-Decidability Problems for Linear and Deterministic Context-Free Languages, Conference on Implementation and Application of Automata (CIAA 2004), Kingston, Ontario, Canada, July 2004

Self-Assembling Finite Automata and Grammars with Scattered Nonterminals, FORMAT-Workshop, Frankfurt, February 2004

On the Descriptional Power of Heads, Counters, and Pebbles, 13. GI-Theorietag, Automaten und Formale Sprachen, Herrsching, Oktober 2003

One-Way Cellular Language Acceptors - A Survey, International IFIP Workshop on Cellular Automata, Leuven, Belgium, September 2003

Dimension and Time Hierarchies for Small Time Bounds, Fundamentals of Computation Theory 2003 (FCT 2003), Malmö, Sweden, August 2003

On the Descriptional Power of Heads, Counters, and Pebbles, Descriptional Complexity of Formal Systems (DCFS 2003), Budapest, Hungary, July 2003

Flip-Pushdown Automata: Nondeterminism is Better Than Determinism, Developments in Language Theory VII (DLT 2003), Szeged, Hungary, July 2003

Self-Assembling Finite Automata and Grammars with Scattered Nonterminals, Colloquium, University of Metz, Metz, France, February 2003

Self-Assembling Finite Automata, 12. GI-Theorietag, Automaten und Formale Sprachen, Wittenberg, September 2002

Unary Language Operations and Their Nondeterministic State Complexity, Developments in Language Theory VI (DLT 2002), Kyoto, Japan, September 2002

Bounded Cellular Automata with Bounded Nondeterminism, International IFIP Workshop on Cellular Automata, Prague, Czech Republic, September 2002

Self-Assembling Finite Automata, International Computing and Combinatorics Conference (COCOON 2002), Singapore, August 2002

Zustandskomplexität einfacher Operationen auf NFAs, 11. GI-Theorietag, Automaten und Formale Sprachen, Wendgräben, October 2001

The Fault Tolerant Early Bird Problem, International IFIP Workshop on Cellular Automata, Porquerolles, France, September 2001

A Time Hierarchy for Bounded One-Way Cellular Automata, Mathematical Foundations of Computer Science (MFCS 2001), Marianske Lazne, Czechia, August 2001

Improving Raster Image Run-Length Encoding Using Data Order, Conference on Implementation and Application of Automata (CIAA 2001), Pretoria, South Africa, July 2001

Refining Nondeterminism Below Linear-Time, Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS 2001), Vienna, Austria, July 2001

Efficient Universal Pushdown Cellular Automata and their Application to Complexity, Universal Machines and Computations (MCU 2001), Chisinau, Moldova, May 2001

Zeit, Dimension, Nichtdeterminismus: Hierarchien zwischen Real- und Linearzeit, Technische Universität München, Munich, February 2001

Deterministische Turingmaschinen mit kleinen Zeitschranken, FORMAT-Workshop, Darmstadt, December 2000

Zellularautomaten - ein paralleles Berechnungsmodell, Colloquium, University of Hannover, Hannover, November 2000

Fault tolerant parallel pattern recognition, International Conference on Cellular Automata for Research and Industry (ACRI 2000), Karlsruhe, October 2000

Deterministische Turingmaschinen zwischen Real- und Linearzeit, 10. GI-Theorietag, Automaten und Formale Sprachen, Vienna, Austria, September 2000

Iterative arrays with small time bounds, Mathematical Foundations of Computer Science (MFCS 2000), Bratislava, Slovakia, September 2000

How small time bounds, dimensions and the amount of nondeterminism interact in iterative arrays, International IFIP Workshop on Cellular Automata, Osaka, Japan, August 2000

Real-time language recognition by alternating cellular automata, IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan, August 2000

Deterministische Turingmaschinen zwischen Real- und Linearzeit, 41. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen, Lübeck, June 2000

Iterative arrays with limited nondeterministic communication cell, International Colloquium on Words, Languages and Combinatorics (ICWLC'00), Kyoto, Japan, March 2000

Synchronisation und Zeitberechenbarkeit von Funktionen in Zellularautomaten, Colloquium, University of Kassel, Kassel, December 1999

Zellularautomaten - ein paralleles Berechnungsmodell, Colloquium, University of Frankfurt, Frankfurt, December 1999

Real-time language recognition by alternating cellular automata, International IFIP Workshop on Cellular Automata, Lyon, France, October 1999

Kontextfreie Sprachen und Polyautomaten, 9. GI-Theorietag, Automaten und Formale Sprachen, Schauenburg-Elmshagen, September 1999

Iterative arrays with a wee bit alternation, Fundamentals of Computation Theory (FCT'99), Iasi, Romania, September 1999

On tally languages and generalized interacting automata, Developments in Language Theory IV (DLT'99), Aachen, July 1999

Alternierende Realzeit-Zellularautomaten, FORMAT-Workshop, Rauischholzhausen, April 1999

Komplexität von Algorithmen, Antrittsvorlesung, April 1999

Sticker-Systeme, Habilitationsvortrag, University of Giessen, February 1999

On unary languages acceptable by cellular devices, Automata'98 (Workshop on Cellular Automata), Santiago, Chile, December 1998

Nichtdeterminismus in zellularen Sprachakzeptoren, FORMAT-Workshop, Frankfurt, October 1998

Eingeschränkter Nichtdeterminismus in Zellularautomaten, 8. GI-Theorietag, Automaten und Formale Sprachen, Riveris, September 1998

One guess one-way cellular arrays, Mathematical Foundations of Computer Science (MFCS'98), Brno, Czechia, August 1998

  1.10.2009
  Zurück zu M. Kutrib