Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Martin Kutrib
2010 – today
- 2013
[j69]Martin Kutrib, Andreas Malcher: One-Dimensional Cellular Automaton Transducers. Fundam. Inform. 126(2-3): 201-224 (2013)
[c89]Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Size of Unary One-Way Multi-head Finite Automata. DCFS 2013: 148-159
[c88]Martin Kutrib, Andreas Malcher, Matthias Wendlandt: One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory 2013: 313-324
[c87]Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt: Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208
[c86]
[c85]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt: Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243
[e6]Jarkko Kari, Martin Kutrib, Andreas Malcher (Eds.): Cellular Automata and Discrete Complex Systems - 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013. Proceedings. Lecture Notes in Computer Science 8155, Springer 2013, ISBN 978-3-642-40866-3- 2012
[j68]Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012)
[j67]Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23(3): 713-732 (2012)
[j66]Martin Kutrib: Non-deterministic cellular automata and languages. Int. J. General Systems 41(6): 555-568 (2012)
[j65]Martin Kutrib, Matthias Wendlandt: String Assembling Systems. RAIRO - Theor. Inf. and Applic. 46(4): 593-613 (2012)
[j64]Martin Kutrib, Andreas Malcher: The Size Impact of Little Iterative Array Resources. J. Cellular Automata 7(5-6): 489-507 (2012)
[j63]Martin Kutrib, Andreas Malcher: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6): 1814-1827 (2012)
[j62]
[j61]Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. 450: 68-80 (2012)
[c84]Martin Kutrib, Andreas Malcher: Iterative Arrays: Little Resources Big Size Impact. ACRI 2012: 42-51
[c83]Martin Kutrib, Friedrich Otto: On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. Languages Alive 2012: 111-137
[c82]Martin Kutrib, Andreas Malcher, Matthias Wendlandt: States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory 2012: 214-225
[c81]Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher: Input-Driven Stack Automata. IFIP TCS 2012: 28-42
[c80]Martin Kutrib, Andreas Malcher, Giovanni Pighizzini: Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN 2012: 518-529
[c79]
[c78]
[c77]Martin Kutrib, Friedrich Otto: On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. CIAA 2012: 253-264
[c76]Martin Kutrib, Andreas Malcher: Transductions Computed by One-Dimensional Cellular Automata. DCM 2012: 194-207
[e5]Henning Bordihn, Martin Kutrib, Bianca Truthe (Eds.): Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 7300, Springer 2012, ISBN 978-3-642-31643-2
[e4]Martin Kutrib, Nelma Moreira, Rogério Reis (Eds.): Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Lecture Notes in Computer Science 7386, Springer 2012, ISBN 978-3-642-31622-7- 2011
[j60]Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp: Computational Complexity of NURIKABE. Fundam. Inform. 110(1-4): 159-174 (2011)
[j59]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)
[j58]Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011)
[j57]Markus Holzer, Martin Kutrib: Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209(3): 456-470 (2011)
[j56]Markus Holzer, Martin Kutrib: The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. 22(7): 1533-1548 (2011)
[j55]Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011)
[j54]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe: Editorial. Journal of Automata, Languages and Combinatorics 16(2-4): 71-74 (2011)
[j53]Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Journal of Automata, Languages and Combinatorics 16(2-4): 91-107 (2011)
[j52]Markus Holzer, Martin Kutrib, Andreas Malcher: Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011)
[j51]Martin Kutrib, Andreas Malcher: Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30): 3917-3931 (2011)
[c75]
[c74]
[c73]Markus Holzer, Martin Kutrib, Ursula Leiter: Nodes Connected by Path Languages. Developments in Language Theory 2011: 276-287
[c72]
[c71]Markus Holzer, Martin Kutrib: Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29
[c70]Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189
[e3]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. Lecture Notes in Computer Science 6808, Springer 2011, ISBN 978-3-642-22599-4- 2010
[j50]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On stateless deterministic restarting automata. Acta Inf. 47(7-8): 391-412 (2010)
[j49]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comput. Sci. 21(5): 781-798 (2010)
[j48]Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-recursive Trade-Offs. Journal of Automata, Languages and Combinatorics 15(1/2): 107-120 (2010)
[j47]Martin Kutrib, Andreas Malcher: One-Way Cellular Automata, Bounded Languages, and Minimal Communication. Journal of Automata, Languages and Combinatorics 15(1/2): 135-153 (2010)
[j46]Martin Kutrib, Andreas Malcher: Real-time reversible iterative arrays. Theor. Comput. Sci. 411(4-5): 812-822 (2010)
[j45]Martin Kutrib, Andreas Malcher: Cellular automata with sparse communication. Theor. Comput. Sci. 411(38-39): 3516-3526 (2010)
[c69]Martin Kutrib, Jonas Lefèvre, Andreas Malcher: The Size of One-Way Cellular Automata. Automata 2010: 71-90
[c68]Markus Holzer, Martin Kutrib: The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30
[c67]Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99
[c66]
[c65]
[c64]
[c63]Markus Holzer, Martin Kutrib: Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing 2010: 19-36
[c62]Markus Holzer, Martin Kutrib: Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23
[c61]
[c60]Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119
[e2]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. books@ocg.at 263, Austrian Computer Society 2010, ISBN 978-3-85403-263-2
2000 – 2009
- 2009
[j44]Martin Kutrib, Andreas Malcher: On One-way One-bit O (One)-message Cellular Automata. Electr. Notes Theor. Comput. Sci. 252: 77-91 (2009)
[j43]Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Inform. 91(1): 105-121 (2009)
[j42]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009)
[j41]Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Int. J. Found. Comput. Sci. 20(4): 563-580 (2009)
[j40]Andreas Klein, Martin Kutrib: Self-Assembling Finite Automata. Journal of Automata, Languages and Combinatorics 14(1): 75-92 (2009)
[j39]Martin Kutrib, Andreas Malcher: Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Processing Letters 19(2): 247-264 (2009)
[j38]Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009)
[j37]Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. 410(37): 3447-3460 (2009)
[c59]Markus Holzer, Martin Kutrib: Descriptional and Computational Complexity of Finite Automata. LATA 2009: 23-42
[c58]Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246
[c57]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Deterministic Restarting Automata. SOFSEM 2009: 353-364
[c56]
[c55]Rudolf Freund, Andreas Klein, Martin Kutrib: On the Number of Membranes in Unary P Systems. DCFS 2009: 101-109
[c54]Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150
[c53]Martin Kutrib, Andreas Malcher: Bounded Languages Meet Cellular Automata with Sparse Communication. DCFS 2009: 163-172
[e1]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. books@ocg.at 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4
[r1]Martin Kutrib: Cellular Automata and Language Theory. Encyclopedia of Complexity and Systems Science 2009: 800-823- 2008
[j36]Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean closure of linear context-free languages. Acta Inf. 45(3): 177-191 (2008)
[j35]Martin Kutrib, Andreas Malcher: Fast reversible language recognition using cellular automata. Inf. Comput. 206(9-10): 1142-1151 (2008)
[j34]Martin Kutrib, Jens Reimann: Succinct description of regular languages by weak restarting automata. Inf. Comput. 206(9-10): 1152-1160 (2008)
[j33]Martin Kutrib, Jens Reimann: Optimal Simulations of Weak Restarting Automata. Int. J. Found. Comput. Sci. 19(4): 795-811 (2008)
[j32]Martin Kutrib: Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies. J. Cellular Automata 3(2): 93-114 (2008)
[c52]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Two-Pushdown Automata and Restarting Automata. AFL 2008: 257-268
[c51]Martin Kutrib, Andreas Malcher: Real-time reversible language recognition by cellular automata. Automata 2008: 208-221
[c50]Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96
[c49]Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157
[c48]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124
[c47]Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16
[c46]Markus Holzer, Martin Kutrib, Andreas Malcher: Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107
[p1]Martin Kutrib: Cellular Automata - A Computational Point of View. New Developments in Formal Languages and Applications 2008: 183-227- 2007
[j31]Martin Kutrib, Andreas Malcher: Finite turns and the regular closure of linear context-free languages. Discrete Applied Mathematics 155(16): 2152-2164 (2007)
[j30]Andreas Klein, Martin Kutrib: Cellular Devices and Unary Languages. Fundam. Inform. 78(3): 343-368 (2007)
[j29]Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007)
[j28]Andreas Klein, Martin Kutrib: Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007)
[j27]Martin Kutrib, Andreas Malcher: When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007)
[j26]Markus Holzer, Martin Kutrib, Jens Reimann: Non-Recursive Trade-Offs for Deterministic Restarting Automata. Journal of Automata, Languages and Combinatorics 12(1-2): 195-213 (2007)
[j25]Martin Kutrib, Andreas Malcher: Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376(1-2): 101-111 (2007)
[j24]Hermann Gruber, Markus Holzer, Martin Kutrib: The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007)
[c45]
[c44]Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119
[c43]
[c42]Martin Kutrib, Andreas Malcher: Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342
[c41]Martin Kutrib, Jens Reimann: Succinct Description of Regular Languages by Weak Restarting Automata. LATA 2007: 343-354
[c40]Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204
[c39]Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated Nondeterminism in Pushdown Automata. CIAA 2007: 85-96- 2006
[j23]Markus Holzer, Martin Kutrib: Variable Complexity of Simple Programs. Fundam. Inform. 74(4): 511-528 (2006)
[c38]
[c37]Martin Kutrib, Andreas Malcher: Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory 2006: 133-144
[c36]Martin Kutrib, Andreas Malcher: Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS 2006: 151-164
[c35]Martin Kutrib, Andreas Malcher: Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS 2006: 634-645
[c34]- 2005
[j22]Henning Bordihn, Markus Holzer, Martin Kutrib: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16(3): 423-440 (2005)
[j21]Martin Kutrib: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16(5): 957-973 (2005)
[j20]Markus Holzer, Martin Kutrib: On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. 330(2): 267-285 (2005)
[j19]Martin Kutrib: On the descriptional power of heads, counters, and pebbles. Theor. Comput. Sci. 330(2): 311-324 (2005)
[c33]Markus Holzer, Martin Kutrib, Jens Reimann: Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169
[c32]Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179- 2004
[j18]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo: Foreword. IEICE Transactions 87-D(3): 647-649 (2004)
[j17]Björn Fay, Martin Kutrib: The Fault-Tolerant Early Bird Problem. IEICE Transactions 87-D(3): 687-693 (2004)
[j16]Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Description for Basic Constructions on Rational Transductions. Journal of Automata, Languages and Combinatorics 9(2/3): 175-188 (2004)
[c31]
[c30]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: 102-113
[c29]Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295
[c28]Markus Holzer, Martin Kutrib: Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU 2004: 233-244
[c27]Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79- 2003
[j15]Martin Kutrib, Jan-Thomas Löwe: Space- and Time-Bounded Nondeterminism for Cellular Automata. Fundam. Inform. 58(2003): 273-293 (2003)
[j14]
[j13]Markus Holzer, Martin Kutrib: Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003)
[j12]Andreas Klein, Martin Kutrib: Fast one-way cellular automata. Theor. Comput. Sci. 295: 233-250 (2003)
[c26]
[c25]Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372
[c24]
[c23]Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP 2003: 490-501- 2002
[j11]Martin Kutrib, Jan-Thomas Löwe: Massively parallel fault tolerant computations on syntactical patterns. Future Generation Comp. Syst. 18(7): 905-919 (2002)
[j10]Thomas Buchholz, Andreas Klein, Martin Kutrib: On Interacting Automata with Limited Nondeterminism. Fundam. Inform. 52(1-3): 15-38 (2002)
[j9]Martin Kutrib: Refining Nondeterminism Below Linear Time. Journal of Automata, Languages and Combinatorics 7(4): 533-547 (2002)
[j8]Andreas Klein, Martin Kutrib: Deterministic Turing machines in the range between real-time and linear-time. Theor. Comput. Sci. 289(1): 253-275 (2002)
[c22]
[c21]Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69
[c20]Markus Holzer, Martin Kutrib: Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory 2002: 162-172
[c19]Martin Kutrib, Jan-Thomas Löwe: String Transformation for n -Dimensional Image Compression. SOFSEM 2002: 208-217
[c18]Markus Holzer, Martin Kutrib: State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA 2002: 148-157- 2001
[c17]Martin Kutrib: Automata arrays and context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 139-148
[c16]
[c15]Martin Kutrib: Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. MCU 2001: 252-263
[c14]Andreas Klein, Martin Kutrib: A Time Hierarchy for Bounded One-Way Cellular Automata. MFCS 2001: 439-450
[c13]Markus Holzer, Martin Kutrib: Improving Raster Image Run-Length Encoding Using Data Order. CIAA 2001: 161-176- 2000
[c12]
[c11]Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics 2000: 73-87
[c10]Thomas Buchholz, Andreas Klein, Martin Kutrib: Real-Time Language Recognition by Alternating Cellular Automata. IFIP TCS 2000: 213-225
[c9]Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252
[c8]Martin Kutrib, Jan-Thomas Löwe: Massively Parallel Pattern Recognition with Link Failures. SOFSEM 2000: 392-401
[i1]Andreas Klein, Martin Kutrib: Deterministic Turing Machines in the Range between Real-Time and Linear-Time. Electronic Colloquium on Computational Complexity (ECCC) 7(75) (2000)
1990 – 1999
- 1999
[j7]Thomas Buchholz, Andreas Klein, Martin Kutrib: On time reduction and simulation in cellular spaces. Int. J. Comput. Math. 71(4): 459-474 (1999)
[j6]
[c7]Thomas Buchholz, Andreas Klein, Martin Kutrib: On tally languages and generalized interacting automata. Developments in Language Theory 1999: 316-325
[c6]Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays with a Wee Bit Alternation. FCT 1999: 173-184- 1998
[j5]Thomas Buchholz, Martin Kutrib: On Time Computability of Functions in One-Way Cellular Automata. Acta Inf. 35(4): 329-352 (1998)
[c5]Thomas Buchholz, Andreas Klein, Martin Kutrib: One Guess One-Way Cellular Arrays. MFCS 1998: 807-815- 1997
[j4]Martin Kutrib, Roland Vollmar, Thomas Worsch: Introduction to the Special Issue on Cellular Automata. Parallel Computing 23(11): 1567-1576 (1997)
[j3]Thomas Buchholz, Martin Kutrib: Some Relations Between Massively Parallel Arrays. Parallel Computing 23(11): 1643-1662 (1997)
[c4]Thomas Buchholz, Martin Kutrib: On the power of one-way bounded cellular time computers. Developments in Language Theory 1997: 365-375- 1996
[c3]Alf-Christian Achilles, Martin Kutrib, Thomas Worsch: On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella 1996: 13-20- 1995
[j2]Martin Kutrib, Roland Vollmar: The Firing Squad Synchronization Problem in Defective Cellular Automata. IEICE Transactions 78-D(7): 895-900 (1995)
[c2]Martin Kutrib, Jörg Richstein: Real-Time One-Way Pushdown Cellular Automata Languages. Developments in Language Theory 1995: 420-429- 1994
[c1]Martin Kutrib, Thomas Worsch: Investigation of Different Input Modes for Cellular Automata. Parcella 1994: 141-150- 1993
[b1]Martin Kutrib: Kellererweiterte Polyautomaten. Universität Giessen 1993, pp. 1-151- 1991
[j1]Martin Kutrib, Roland Vollmar: Minimal Time Synchronization in Restricted Defective Cellular Automata. Elektronische Informationsverarbeitung und Kybernetik 27(3): 179-196 (1991)
Coauthor Index
[j68] [j62] [j61] [c81] [j60] [j59] [j58] [j57] [j56] [j53] [j52] [c75] [c73] [c71] [c70] [e3] [j48] [c68] [c63] [c62] [c60] [e2] [j43] [j42] [j41] [j38] [c59] [c58] [c54] [e1] [c50] [c48] [c47] [c46] [j29] [j26] [j24] [c44] [c40] [j23] [c38] [c34] [j22] [j20] [c33] [c32] [j16] [c30] [c28] [c27] [j13] [c25] [c23] [c21] [c20] [c18] [c13]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-15 21:39 CEST by the dblp team



