| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Markus Holzer, Sebastian Jakobi, Martin Kutrib |
The Magic Number Problem for Subregular Language Families.  |
Int. J. Found. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Giovanni Pighizzini |
Oblivious Two-Way Finite Automata: Decidability and Complexity. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Cellular automata with limited inter-cell bandwidth. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Andreas Malcher |
Complexity of multi-head finite automata: Origins and directions. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Martin Kutrib, Andreas Malcher |
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
The Complexity of Regular(-like) Expressions. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Descriptional and computational complexity of finite automata - A survey. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Decidability of operation problems for T0L languages and subclasses. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto |
Preface. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp |
Computational Complexity of NURIKABE. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Ursula Leiter |
Nodes Connected by Path Languages. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Matthias Wendlandt |
String Assembling Systems. |
NCMA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Sebastian Jakobi, Martin Kutrib |
The Chop of Languages. |
AFL |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Giovanni Pighizzini (eds.) |
Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Gaining Power by Input Operations: Finite Automata and Beyond. |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Katja Meckel |
Nondeterministic State Complexity of Star-Free Languages. |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
Nature-Based Problems in Cellular Automata. |
CiE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Cellular automata with sparse communication. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Real-time reversible iterative arrays. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Two-Pushdown Automata and Restarting Automata. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On stateless deterministic restarting automata. |
Acta Inf. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Sebastian Jakobi, Martin Kutrib |
The Magic Number Problem for Subregular Language Families |
DCFS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Reversible Pushdown Automata. |
LATA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
The Complexity of Regular(-Like) Expressions. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Martin Kutrib, Andreas Malcher |
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jonas Lefèvre, Andreas Malcher |
The Size of One-Way Cellular Automata. |
Automata |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Transductions Computed by Iterative Arrays. |
JAC |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Measuring Communication in Cellular Automata. |
JAC |
2010 |
DBLP BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto (eds.) |
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings |
NCMA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. |
Int. Conf. on Membrane Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Two-Party Watson-Crick Computations. |
CIAA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Determination of finite automata accepting subregular languages. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Larissa Werlein |
Regulated nondeterminism in pushdown automata. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib |
On input-revolving deterministic and nondeterministic finite automata. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
On One-way One-bit O (One)-message Cellular Automata. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Computations and Decidability of Iterative Arrays with Restricted Communication. |
Parallel Processing Letters |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer, Martin Kutrib |
More on the Size of Higman-Haines Sets: Effective Constructions. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Freund, Andreas Klein, Martin Kutrib |
On the Number of Membranes in Unary P Systems |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Bounded Languages Meet Cellular Automata with Sparse Communication |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer, Martin Kutrib |
On Measuring Non-Recursive Trade-Offs |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
Cellular Automata and Language Theory. |
Encyclopedia of Complexity and Systems Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Undecidability of Operation Problems for T0L Languages and Subclasses. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Descriptional and Computational Complexity of Finite Automata. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto (eds.) |
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings |
NCMA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Deterministic Restarting Automata. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Cellular Automata with Sparse Communication. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jens Reimann |
Optimal Simulations of Weak Restarting Automata. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Detlef Wotschke |
The Boolean closure of linear context-free languages. |
Acta Inf. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Fast reversible language recognition using cellular automata. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jens Reimann |
Succinct description of regular languages by weak restarting automata. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies. |
J. Cellular Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Andreas Malcher |
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems |
CSP |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib |
Cellular Automata - A Computational Point of View. |
New Developments in Formal Languages and Applications |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib |
Deterministic Input-Reversal and Input-Revolving Finite Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Martin Kutrib, Andreas Malcher |
On the Computational Capacity of Parallel Communicating Finite Automata. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Real-time reversible language recognition by cellular automata. |
Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Two-Pushdown Automata and Restarting Automata. |
AFL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
State Complexity of NFA to DFA Conversion of Subregular Language Families. |
DCFS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. |
CIAA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer, Martin Kutrib |
The size of Higman-Haines sets. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Context-dependent nondeterminism for pushdown automata. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Hybrid Extended Finite Automata. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
When Church-Rosser Becomes Context Free. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Klein, Martin Kutrib |
Context-Free Grammars with Linked Nonterminals. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Klein, Martin Kutrib |
Cellular Devices and Unary Languages. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Jens Reimann |
Non-Recursive Trade-Offs for Deterministic Restarting Automata. |
Journal of Automata, Languages and Combinatorics |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Finite turns and the regular closure of linear context-free languages. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jens Reimann |
Succinct Description of Regular Languages by Weak Restarting Automata. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Fast Reversible Language Recognition Using Cellular Automata. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer, Martin Kutrib |
More on the Size of Higman-Haines Sets: Effective Constructions. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Real-Time Reversible Iterative Arrays. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Hairpin Finite Automata. |
Developments in Language Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jens Reimann |
Optimal Simulations of Weak Restarting Automata. |
DCFS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Larissa Werlein |
Regulated Nondeterminism in Pushdown Automata. |
CIAA |
2007 |
DBLP DOI BibTeX RDF |
regulated nondeterminism, limited nondeterminism, pushdown automata, closure properties |
| 1 | Markus Holzer, Martin Kutrib |
Variable Complexity of Simple Programs. |
Fundam. Inform. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Context-Dependent Nondeterminism for Pushdown Automata. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher |
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. |
IFIP TCS |
2006 |
DBLP DOI BibTeX RDF |
Restricted communication, Computational capacity, Parallel computing, Cellular automata, Formal languages, Iterative arrays |
| 1 | Markus Holzer, Martin Kutrib |
The Size of Higman-Haines Sets. |
DCFS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Hybrid Extended Finite Automata. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
On the descriptional power of heads, counters, and pebbles. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
On the descriptional complexity of finite automata with modified acceptance conditions. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
The phenomenon of non-recursive trade-offs. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Unsolvability levels of operation problems for subclasses of context-free languages. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Revolving-Input Finite Automata. |
Developments in Language Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib, Jens Reimann |
Descriptional Complexity of Deterministic Restarting Automata. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Björn Fay, Martin Kutrib |
The Fault-Tolerant Early Bird Problem. |
IEICE Transactions |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Maurice Margenstern, Hiroshi Umeo |
Foreword. |
IEICE Transactions |
2004 |
DBLP BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Economy of Description for Basic Constructions on Rational Transductions. |
Journal of Automata, Languages and Combinatorics |
2004 |
DBLP BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Register Complexity of LOOP-, WHILE-, and GOTO-Programs. |
MCU |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Andreas Malcher, Detlef Wotschke |
The Boolean Closure of Linear Context-Free Languages. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib |
The Phenomenon of Non-Recursive Trade-Offs. |
DCFS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. |
CIAA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Klein, Martin Kutrib |
Fast one-way cellular automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Nondeterministic Descriptional Complexity Of Regular Languages. |
Int. J. Found. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Jan-Thomas Löwe |
Space- and Time-Bounded Nondeterminism for Cellular Automata. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Maurice Margenstern, Hiroshi Umeo |
Foreword. |
Fundam. Inform. |
2003 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")