 | 2009 |
|---|
| 29 |       | Martin Kutrib,
Andreas Malcher:
Cellular Automata with Sparse Communication.
CIAA 2009: 34-43 |
| 28 | | Andreas Malcher,
Giovanni Pighizzini:
Descriptional complexity of bounded context-free languages
CoRR abs/0905.1045: (2009) |
| 27 | | Martin Kutrib,
Andreas Malcher:
Bounded Languages Meet Cellular Automata with Sparse Communication
CoRR abs/0907.5128: (2009) |
| 26 | | Martin Kutrib,
Andreas Malcher:
On One-way One-bit O (One)-message Cellular Automata.
Electr. Notes Theor. Comput. Sci. 252: 77-91 (2009) |
| 25 | | Martin Kutrib,
Andreas Malcher:
Computations and Decidability of Iterative Arrays with Restricted Communication.
Parallel Processing Letters 19(2): 247-264 (2009) |
| 24 | | Martin Kutrib,
Andreas Malcher,
Larissa Werlein:
Regulated nondeterminism in pushdown automata.
Theor. Comput. Sci. 410(37): 3447-3460 (2009) |
| 2008 |
|---|
| 23 | | Markus Holzer,
Martin Kutrib,
Andreas Malcher:
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
CSP 2008: 93-107 |
| 22 | | Henning Bordihn,
Martin Kutrib,
Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata.
Developments in Language Theory 2008: 146-157 |
| 21 | | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean closure of linear context-free languages.
Acta Inf. 45(3): 177-191 (2008) |
| 20 | | Martin Kutrib,
Andreas Malcher:
Fast reversible language recognition using cellular automata.
Inf. Comput. 206(9-10): 1142-1151 (2008) |
| 19 | | Remco Loos,
Andreas Malcher,
Detlef Wotschke:
Descriptional Complexity of Splicing Systems.
Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) |
| 2007 |
|---|
| 18 | | Martin Kutrib,
Andreas Malcher,
Larissa Werlein:
Regulated Nondeterminism in Pushdown Automata.
CIAA 2007: 85-96 |
| 17 | | Andreas Malcher,
Giovanni Pighizzini:
Descriptional Complexity of Bounded Context-Free Languages.
Developments in Language Theory 2007: 312-323 |
| 16 | | Martin Kutrib,
Andreas Malcher:
Real-Time Reversible Iterative Arrays.
FCT 2007: 376-387 |
| 15 | | Martin Kutrib,
Andreas Malcher:
Finite turns and the regular closure of linear context-free languages.
Discrete Applied Mathematics 155(16): 2152-2164 (2007) |
| 14 | | Martin Kutrib,
Andreas Malcher:
When Church-Rosser Becomes Context Free.
Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) |
| 13 | | Andreas Malcher,
Bettina Sunckel:
On Metalinear Parallel Communicating Grammar Systems.
Int. J. Found. Comput. Sci. 18(6): 1313-1322 (2007) |
| 12 |  | 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) |
| 11 | | Martin Kutrib,
Andreas Malcher:
Context-dependent nondeterminism for pushdown automata.
Theor. Comput. Sci. 376(1-2): 101-111 (2007) |
| 2006 |
|---|
| 10 | | Martin Kutrib,
Andreas Malcher:
Context-Dependent Nondeterminism for Pushdown Automata.
Developments in Language Theory 2006: 133-144 |
| 9 | | Martin Kutrib,
Andreas Malcher:
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity.
IFIP TCS 2006: 151-164 |
| 8 | | Martin Kutrib,
Andreas Malcher:
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.
MFCS 2006: 634-645 |
| 2005 |
|---|
| 7 | | Andreas Malcher:
On two-way communication in cellular automata with a fixed number of cells.
Theor. Comput. Sci. 330(2): 325-338 (2005) |
| 2004 |
|---|
| 6 | | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages.
Developments in Language Theory 2004: 284-295 |
| 5 | | Andreas Malcher:
Minimizing finite automata is computationally hard.
Theor. Comput. Sci. 327(3): 375-390 (2004) |
| 2003 |
|---|
| 4 | | Andreas Malcher:
Minimizing Finite Automata Is Computationally Hard.
Developments in Language Theory 2003: 386-397 |
| 3 | | Andreas Malcher:
On One-Way Cellular Automata with a Fixed Number of Cells.
Fundam. Inform. 58(2003): 355-368 (2003) |
| 2002 |
|---|
| 2 | | 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) |
| 1 | | Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions.
Journal of Automata, Languages and Combinatorics 7(4): 549-560 (2002) |
