- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j32 |      | Andreas Malcher, Giovanni Pighizzini: Descriptional complexity of bounded context-free languages. Inf. Comput. 227: 1-20 (2013) |
| 2012 | ||
| j31 | | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: First-order logics: some characterizations and closure properties. Acta Inf. 49(4): 225-248 (2012) |
| j30 | | Martin Kappes, Andreas Malcher, Detlef Wotschke: In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23(1): 5-19 (2012) |
| j29 | | 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) |
| j28 | | Martin Kutrib, Andreas Malcher: The Size Impact of Little Iterative Array Resources. J. Cellular Automata 7(5-6): 489-507 (2012) |
| j27 | | Martin Kutrib, Andreas Malcher: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6): 1814-1827 (2012) |
| j26 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449: 119-133 (2012) |
| c39 | | Martin Kutrib, Andreas Malcher: Iterative Arrays: Little Resources Big Size Impact. ACRI 2012: 42-51 |
| c38 | | Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano: Descriptional Complexity of Pushdown Store Languages. DCFS 2012: 209-221 |
| c37 | | Martin Kutrib, Andreas Malcher, Matthias Wendlandt: States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory 2012: 214-225 |
| c36 | | Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher: Input-Driven Stack Automata. IFIP TCS 2012: 28-42 |
| c35 | | Martin Kutrib, Andreas Malcher, Giovanni Pighizzini: Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN 2012: 518-529 |
| c34 | | |
| c33 | | Martin Kutrib, Andreas Malcher: Transductions Computed by One-Dimensional Cellular Automata. DCM 2012: 194-207 |
| 2011 | ||
| j25 | | 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) |
| j24 | | Markus Holzer, Martin Kutrib, Andreas Malcher: Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011) |
| j23 | | Martin Kutrib, Andreas Malcher: Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30): 3917-3931 (2011) |
| c32 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS 2011: 248-260 |
| 2010 | ||
| j22 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. 21(5): 843-858 (2010) |
| j21 |  | 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) |
| j20 | | Martin Kutrib, Andreas Malcher: Real-time reversible iterative arrays. Theor. Comput. Sci. 411(4-5): 812-822 (2010) |
| j19 | | Martin Kutrib, Andreas Malcher: Cellular automata with sparse communication. Theor. Comput. Sci. 411(38-39): 3516-3526 (2010) |
| c31 | | Martin Kutrib, Jonas Lefèvre, Andreas Malcher: The Size of One-Way Cellular Automata. Automata 2010: 71-90 |
| c30 | | Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 |
| c29 | | |
| c28 | | |
| c27 | | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: On the Expressive Power of FO[ + ]. LATA 2010: 190-201 |
| c26 | | |
| c25 | | |
| c24 | | |
| 2009 | ||
| j18 | | Martin Kutrib, Andreas Malcher: On One-way One-bit O (One)-message Cellular Automata. Electr. Notes Theor. Comput. Sci. 252: 77-91 (2009) |
| j17 | | Jürgen Dassow, Andreas Malcher: Editorial. Journal of Automata, Languages and Combinatorics 14(1): 5-6 (2009) |
| j16 | | Martin Kutrib, Andreas Malcher: Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Processing Letters 19(2): 247-264 (2009) |
| j15 | | Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. 410(37): 3447-3460 (2009) |
| c23 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Logical Description of Structured and XML Languages. ICTCS 2009: 162-168 |
| c22 | | |
| c21 | | Martin Kutrib, Andreas Malcher: Bounded Languages Meet Cellular Automata with Sparse Communication. DCFS 2009: 163-172 |
| i1 | | Andreas Malcher, Giovanni Pighizzini: Descriptional complexity of bounded context-free languages. CoRR abs/0905.1045 (2009) |
| 2008 | ||
| j14 | | Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean closure of linear context-free languages. Acta Inf. 45(3): 177-191 (2008) |
| j13 | | Martin Kutrib, Andreas Malcher: Fast reversible language recognition using cellular automata. Inf. Comput. 206(9-10): 1142-1151 (2008) |
| j12 | | Remco Loos, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) |
| c20 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Sublinearly Space Bounded Iterative Arrays. AFL 2008: 292-301 |
| c19 | | Martin Kutrib, Andreas Malcher: Real-time reversible language recognition by cellular automata. Automata 2008: 208-221 |
| c18 | | Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Recent results on iterative arrays with small space bounds. Automata 2008: 222-227 |
| c17 | | Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157 |
| c16 | | Markus Holzer, Martin Kutrib, Andreas Malcher: Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107 |
| 2007 | ||
| j11 | | Martin Kutrib, Andreas Malcher: Finite turns and the regular closure of linear context-free languages. Discrete Applied Mathematics 155(16): 2152-2164 (2007) |
| j10 | | Martin Kutrib, Andreas Malcher: When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) |
| j9 | | Andreas Malcher, Bettina Sunckel: On Metalinear Parallel Communicating Grammar Systems. Int. J. Found. Comput. Sci. 18(6): 1313-1322 (2007) |
| j8 | | Andreas Malcher: On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. Journal of Automata, Languages and Combinatorics 12(1-2): 265-277 (2007) |
| j7 | | Martin Kutrib, Andreas Malcher: Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376(1-2): 101-111 (2007) |
| c15 | | Remco Loos, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104 |
| c14 | | Andreas Malcher, Giovanni Pighizzini: Descriptional Complexity of Bounded Context-Free Languages. Developments in Language Theory 2007: 312-323 |
| c13 | | |
| c12 | | Martin Kutrib, Andreas Malcher: Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342 |
| c11 | | Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated Nondeterminism in Pushdown Automata. CIAA 2007: 85-96 |
| 2006 | ||
| c10 | | |
| c9 | | Martin Kutrib, Andreas Malcher: Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory 2006: 133-144 |
| c8 | | Martin Kutrib, Andreas Malcher: Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS 2006: 151-164 |
| c7 | | Martin Kutrib, Andreas Malcher: Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS 2006: 634-645 |
| 2005 | ||
| j6 | | Andreas Malcher: On two-way communication in cellular automata with a fixed number of cells. Theor. Comput. Sci. 330(2): 325-338 (2005) |
| c6 | | Andreas Malcher: On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. DCFS 2005: 215-226 |
| 2004 | ||
| b1 | | Andreas Malcher: Beschreibungskomplexität von Zellularautomaten. Goethe University Frankfurt am Main 2004, pp. 1-136 |
| j5 | | Andreas Malcher: On the Descriptional Complexity of Iterative Arrays. IEICE Transactions 87-D(3): 721-725 (2004) |
| j4 | | Andreas Malcher: Minimizing finite automata is computationally hard. Theor. Comput. Sci. 327(3): 375-390 (2004) |
| c5 | | Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295 |
| 2003 | ||
| j3 | | Andreas Malcher: On One-Way Cellular Automata with a Fixed Number of Cells. Fundam. Inform. 58(2003): 355-368 (2003) |
| c4 | | Andreas Malcher: On Two-Way Communication in Cellular Automata With a Fixed Number of Cells. DCFS 2003: 162-173 |
| c3 | | Andreas Malcher: Minimizing Finite Automata Is Computationally Hard. Developments in Language Theory 2003: 386-397 |
| 2002 | ||
| j2 | | Andreas Malcher: Descriptional Complexity of Cellular Automata and Decidability Questions. Journal of Automata, Languages and Combinatorics 7(4): 549-560 (2002) |
| j1 | | Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Machines with Limited Resources. J. UCS 8(2): 193-234 (2002) |
| c2 | | |
| 2001 | ||
| c1 | | Andreas Malcher: Descriptional Complexity of Cellular Automata and Decidability Questions. DCFS 2001: 123-131 |
Data released under the ODC-BY 1.0 license — See also our legal information page