Martin Kutrib

发表

Input-Driven DoubleHead Pushdown Automata

M. Holzer, Martin Kutrib, Andreas Malcher, 2017 .

NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY

Martin Kutrib, Markus Holzer, M. Holzer, 2009 .

Henning Fernau, Martin Kutrib, Matthias Wendlandt, 2017, NCMA.

Automata Arrays and Context-free Languages Justus-liebig- Universit at Gieeen Automata Arrays and Context-free Languages

Martin Kutrib, 1999 .

Descriptional Complexity of Bounded Regular Languages

Martin Kutrib, Andreas Malcher, Andrea Herrmann, 2017, J. Autom. Lang. Comb..

Measuring Communication in Cellular Automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, JAC.

Editorial

Martin Kutrib, Bianca Truthe, Markus Holzer, 2016, J. Autom. Lang. Comb..

Descriptional Complexity of Deterministic Restarting Automata

Martin Kutrib, Markus Holzer, Jens Reimann, 2005, DCFS.

Automata that may change their mind

Martin Kutrib, Markus Holzer, M. Holzer, 2018, NCMA.

Digging input-driven pushdown automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2019, NCMA.

Revisiting the cutting of the firing squad synchronization

Martin Kutrib, Georgios Ch. Sirakoulis, Antonios Dimitriadis, 2018, Natural Computing.

String Generation by Cellular Automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2021, Complex Syst..

One-Dimensional Pattern Generation by Cellular Automata

Martin Kutrib, Andreas Malcher, 2020, ACRI.

Compiling Janus to RSSA

Martin Kutrib, Niklas Deworetzki, Uwe Meyer, 2021, RC.

Hot Current Topics of Descriptional Complexity

Nelma Moreira, Rogério Reis, Martin Kutrib, 2021, IFIP's Exciting First 60+ Years.

Oblivious two-way finite automata: Decidability and complexity

G. Pighizzini, Martin Kutrib, Andreas Malcher, 2014 .

Minimal Time Synchronization in Restricted Defective Cellular Automata

Martin Kutrib, Roland Vollmar, R. Vollmar, 1991, J. Inf. Process. Cybern..

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, DCFS.

Iterated Transduction on Unary Languages (cid:63) (short paper)

Martin Kutrib, Andreas Malcher, C. Mereghetti, 2021 .

Boolean Kernels of Context-Free Languages

Martin Kutrib, Luca Prigioniero, Martin Kutrib, 2021, CIAA.

Reversible Queue Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Fundam. Informaticae.

Hairpin Finite Automata

Martin Kutrib, Markus Holzer, Henning Bordihn, 2007, Developments in Language Theory.

Cellular Automata - A Computational Point of View

Martin Kutrib, Martin Kutrib, 2008, New Developments in Formal Languages and Applications.

Relations and Transductions Realized by Restarting Automata

Martin Kutrib, Friedrich Otto, Informatik, 2013 .

Descriptional Complexity - An Introductory Survey

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Scientific Applications of Language Methods.

Two-sided locally testable languages

Martin Kutrib, Friedrich Otto, F. Otto, 2018, NCMA.

The Firing Squad Synchronization Problem in Defective Cellular Automata

Martin Kutrib, Roland Vollmar, R. Vollmar, 1995, IEICE Trans. Inf. Syst..

Preface

Martin Kutrib, Markus Holzer, Giovanni Pighizzini, 1992, Theor. Comput. Sci..

Preface

Martin Kutrib, Markus Holzer, Martin Kutrib, 2021, Int. J. Found. Comput. Sci..

Cellular String Generators

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2020, Automata.

String Assembling Systems: Comparison to Sticker Systems and Decidability

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2021, UCNC.

Proceedings of the 13th international conference on Descriptional complexity of formal systems

Martin Kutrib, Markus Holzer, Giovanni Pighizzini, 2011 .

Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Int. J. Found. Comput. Sci..

Two-sided strictly locally testable languages

Martin Kutrib, Friedrich Otto, Markus Holzer, 2017, NCMA.

Foreword

Hiroshi Umeo, Martin Kutrib, Maurice Margenstern, 1948, Fundam. Informaticae.

Tinput-Driven Pushdown, Counter, and Stack Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2017, Fundam. Informaticae.

Boosting Reversible Pushdown and Queue Machines by Preprocessing

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2020, Int. J. Found. Comput. Sci..

Deterministic Stack Transducers

Martin Kutrib, Suna Bensch, Johanna Björklund, 2017, Int. J. Found. Comput. Sci..

Preface

Martin Kutrib, Jan M. Baetens, J. Baetens, 2020, Nat. Comput..

State Complexity of NFA to DFA Conversion of Subregular Language Families

Martin Kutrib, Markus Holzer, Henning Bordihn, 2008, DCFS.

Real-Time One-Way Pushdown Cellular Automata Languages

Martin Kutrib, Jörg Richstein, J. Richstein, 1995, Developments in Language Theory.

On Interacting Automata with Limited Nondeterminism Justus-liebig- Universit at Gieeen on Interacting Automata with Limited Nondeterminism

Martin Kutrib, N. Buchholz, Andreas Klein, 1998 .

Special Section on Cellular Automata

Hiroshi Umeo, Martin Kutrib, Maurice Margenstern, 2004 .

Nonterminal Controlled String Assembling Systems

Martin Kutrib, Matthias Wendlandt, Henning Bordihn, 2014, J. Autom. Lang. Comb..

Preface

Martin Kutrib, Bianca Truthe, Markus Holzer, 2016, J. Autom. Lang. Comb..

Reversible Top-Down Syntax Analysis

Martin Kutrib, Uwe Meyer, Martin Kutrib, 2021, DLT.

Preface

Martin Kutrib, Markus Holzer, M. Holzer, 2015, Int. J. Found. Comput. Sci..

Kellererweiterte Polyautomaten

Martin Kutrib, Martin Kutrib, 1993 .

The Size Impact of Little Iterative Array Resources

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2012, J. Cell. Autom..

Preface

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2003, Adv. Robotics.

Self-Assembling Pushdown Automata

Martin Kutrib, Markus Holzer, M. Holzer, 2014, J. Autom. Lang. Comb..

Ein Satz über Free-Choice-Petrinetze.

Martin Kutrib, Markus Holzer, Martin Kutrib, 1983 .

Reversible pushdown transducers

Martin Kutrib, Andreas Malcher, Luca Prigioniero, 2021, Inf. Comput..

Descriptional complexity of regular languages

Martin Kutrib, Markus Holzer, Hermann Gruber, 2021, Handbook of Automata Theory.

One-Way Cellular Automata, Bounded Languages, and Minimal Communication

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, J. Autom. Lang. Comb..

Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies

Martin Kutrib, Martin Kutrib, 2008, J. Cell. Autom..

Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, C. Mereghetti, 2022, Fundam. Informaticae.

Editorial

Nelma Moreira, Rogério Reis, Martin Kutrib, 2012, J. Autom. Lang. Comb..

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial

Martin Kutrib, Bianca Truthe, Jürgen Dassow, 2011, J. Autom. Lang. Comb..

State Complexity of Partial Word Finite Automata

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2021, DCFS.

Reversible Computations of One-Way Counter Automata

Martin Kutrib, Andreas Malcher, 2022, Electronic Proceedings in Theoretical Computer Science.

Variants of string assembling systems

Martin Kutrib, Matthias Wendlandt, 2022, Natural Computing.

Iterative arrays with finite inter-cell communication

Martin Kutrib, Andreas Malcher, 2020, Natural Computing.

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2015, Theor. Comput. Sci..

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2013, CIAA.

Concatenation-free languages

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2017, Theor. Comput. Sci..

Expressive capacity of subregular expressions

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2018, NCMA.

Expressive Capacity of Concatenation Freeness

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2015, CIAA.

Descriptional and computational complexity of finite automata - A survey

Martin Kutrib, Markus Holzer, M. Holzer, 2011, Inf. Comput..

Descriptional and Computational Complexity of Finite Automata

Martin Kutrib, Markus Holzer, M. Holzer, 2009, LATA.

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2004, CIAA.

Descriptional Complexity of Formal Systems

Rogério Reis, Martin Kutrib Nelma Moreira, Nelma Moreira, 2012, Lecture Notes in Computer Science.

Queue Automata: Foundations and Developments

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, Reversibility and Universality.

Deterministic Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Developments in Language Theory.

Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, CiE.

Descriptional Complexity of Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, DCFS.

Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, ICTCS.

Cellular Automata and Discrete Complex Systems

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2013, Lecture Notes in Computer Science.

Time-Symmetric Machines

Martin Kutrib, Thomas Worsch, Martin Kutrib, 2013, RC.

Reversible pushdown automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2010, J. Comput. Syst. Sci..

Finite turns and the regular closure of linear context-free languages

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2007, Discret. Appl. Math..

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Int. Conf. on Membrane Computing.

Introduction to the Special Issue on Cellular Automata

Martin Kutrib, Roland Vollmar, Thomas Worsch, 1997, Parallel Comput..

Some Relations Between Massively Parallel Arrays

T. Buchholz, Martin Kutrib, 1997, Parallel Comput..

20. Theorietag der GI-Fachgruppe "Automaten und Formale Sprachen''

Henrik Björklund, Artiom Alhazov, Rudolf Freund, 2010 .

One-Time Nondeterministic Computations

Martin Kutrib, Markus Holzer, M. Holzer, 2017, DCFS.

Multi-stranded String Assembling Systems

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2019, SOFSEM.

Stateless One-Way Multi-Head Finite Automata with Pebbles

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Int. J. Found. Comput. Sci..

Head and state hierarchies for unary multi-head finite automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Acta Informatica.

One-Way Multi-Head Finite Automata with Pebbles But No States

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2013, Developments in Language Theory.

States and Heads Do Count for Unary Multi-head Finite Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2012, Developments in Language Theory.

One-way reversible multi-head finite automata

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2012, Theor. Comput. Sci..

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2010, Int. J. Found. Comput. Sci..

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

Martin Kutrib, Andreas Malcher, Markus Holzer, 2009, CSP.

On the Computational Capacity of Parallel Communicating Finite Automata

Martin Kutrib, Andreas Malcher, Henning Bordihn, 2008, Int. J. Found. Comput. Sci..

Complexity of multi-head finite automata: Origins and directions

Martin Kutrib, Andreas Malcher, Markus Holzer, 2011, Theor. Comput. Sci..

Automaten und Formale Sprachen

Martin Kutrib, Andreas Malcher, Markus Holzer, 2008 .

On Stateless Two-Pushdown Automata and Restarting Automata

Martin Kutrib, Friedrich Otto, Hartmut Messerschmidt, 2010, Int. J. Found. Comput. Sci..

On stateless deterministic restarting automata

Martin Kutrib, Friedrich Otto, Hartmut Messerschmidt, 2009, Acta Informatica.

Foundations of Reversible Computation

Robert Glück, Ivan Lanese, Jarkko Kari, 2020, Selected Results of the COST Action IC1405.

Descriptional Complexity of Formal Systems

H Germany, France., Finland., 2016, Lecture Notes in Computer Science.

The size of Higman-Haines sets

Martin Kutrib, Markus Holzer, Hermann Gruber, 2007, Theor. Comput. Sci..

On Measuring Non-recursive Trade-Offs

Martin Kutrib, Markus Holzer, Hermann Gruber, 2009, J. Autom. Lang. Comb..

More on the Size of Higman-Haines Sets: Effective Constructions

Martin Kutrib, Markus Holzer, Hermann Gruber, 2007, Fundam. Informaticae.

On time computability of functions in one-way cellular automata

Martin Kutrib, Thomas Buchholz, T. Buchholz, 1998, Acta Informatica.

Improving Raster Image Run-Length Encoding Using Data Order

M. Holzer, Martin Kutrib, 2001, CIAA.

Cellular Automata and Discrete Complex Systems

Jarkko Kari, Martin Kutrib, Andreas Malcher, 2015, Lecture Notes in Computer Science.

Operational State Complexity and Decidability of Jumping Finite Automata

Martin Kutrib, Markus Holzer, Simon Beier, 2017, DLT.

Diving into the queue

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, NCMA.

Gaining Power by Input Operations: Finite Automata and Beyond

Martin Kutrib, Markus Holzer, M. Holzer, 2011, CIAA.

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages

Martin Kutrib, Markus Holzer, Henning Bordihn, 2004, Developments in Language Theory.

Computational Complexity of NURIKABE

Martin Kutrib, Markus Holzer, Andreas Klein, 2011, Fundam. Informaticae.

On The NP-Completeness of The Nurikabe Pencil Puzzle and Variants Thereof

Martin Kutrib, Markus Holzer, M. Holzer, 2008 .

Revisiting the cutting of the firing squad synchronization

G. Sirakoulis, Martin Kutrib, Antonios Dimitriadis, 2018, Natural Computing.

Cutting the Firing Squad Synchronization

Martin Kutrib, Georgios Ch. Sirakoulis, Antonios Dimitriadis, 2016, ACRI.

Nature-Based Problems in Cellular Automata

Martin Kutrib, Martin Kutrib, 2011, CiE.

The Fault-Tolerant Early Bird Problem

Martin Kutrib, Björn Fay, Martin Kutrib, 2004, IEICE Trans. Inf. Syst..

Cellular Automata and Language Theory

Martin Kutrib, Martin Kutrib, 2009, Encyclopedia of Complexity and Systems Science.

Unary Language Operations and Their Nondeterministic State Complexity

Martin Kutrib, Markus Holzer, M. Holzer, 2002, Developments in Language Theory.

State complexity of basic operations on nondeterministic finite automata

Martin Kutrib, Markus Holzer, M. Holzer, 2002, CIAA'02.

Tinput-Driven Pushdown Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2015, MCU.

Parameterized Prefix Distance between Regular Languages

Martin Kutrib, Katja Meckel, Matthias Wendlandt, 2014, SOFSEM.

One-Dimensional Cellular Automaton Transducers

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2013, Fundam. Informaticae.

Nondeterministic state complexity of star-free languages

Martin Kutrib, Katja Meckel, Markus Holzer, 2011, Theor. Comput. Sci..

Cellular Automata: Descriptional Complexity and Decidability

Martin Kutrib, Andreas Malcher, Martin Kutrib, 2018, Reversibility and Universality.

The chop of languages

Martin Kutrib, Markus Holzer, Sebastian Jakobi, 2017, Theor. Comput. Sci..

The Complexity of Regular(-like) Expressions

Martin Kutrib, Markus Holzer, M. Holzer, 2010, Int. J. Found. Comput. Sci..

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata

Martin Kutrib, Friedrich Otto, F. Otto, 2012, Languages Alive.