| 2008 |
|---|
| 18 | EE | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean closure of linear context-free languages.
Acta Inf. 45(3): 177-191 (2008) |
| 2007 |
|---|
| 17 | EE | Martin Kutrib,
Andreas Malcher,
Larissa Werlein:
Regulated Nondeterminism in Pushdown Automata.
CIAA 2007: 85-96 |
| 16 | EE | Andreas Malcher,
Giovanni Pighizzini:
Descriptional Complexity of Bounded Context-Free Languages.
Developments in Language Theory 2007: 312-323 |
| 15 | EE | Martin Kutrib,
Andreas Malcher:
Real-Time Reversible Iterative Arrays.
FCT 2007: 376-387 |
| 14 | EE | Martin Kutrib,
Andreas Malcher:
Finite turns and the regular closure of linear context-free languages.
Discrete Applied Mathematics 155(16): 2152-2164 (2007) |
| 13 | EE | Martin Kutrib,
Andreas Malcher:
When Church-Rosser Becomes Context Free.
Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) |
| 12 | EE | Andreas Malcher,
Bettina Sunckel:
On Metalinear Parallel Communicating Grammar Systems.
Int. J. Found. Comput. Sci. 18(6): 1313-1322 (2007) |
| 11 | EE | Martin Kutrib,
Andreas Malcher:
Context-dependent nondeterminism for pushdown automata.
Theor. Comput. Sci. 376(1-2): 101-111 (2007) |
| 2006 |
|---|
| 10 | EE | Martin Kutrib,
Andreas Malcher:
Context-Dependent Nondeterminism for Pushdown Automata.
Developments in Language Theory 2006: 133-144 |
| 9 | EE | Martin Kutrib,
Andreas Malcher:
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity.
IFIP TCS 2006: 151-164 |
| 8 | EE | Martin Kutrib,
Andreas Malcher:
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability.
MFCS 2006: 634-645 |
| 2005 |
|---|
| 7 | EE | 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 | EE | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages.
Developments in Language Theory 2004: 284-295 |
| 5 | EE | Andreas Malcher:
Minimizing finite automata is computationally hard.
Theor. Comput. Sci. 327(3): 375-390 (2004) |
| 2003 |
|---|
| 4 | EE | Andreas Malcher:
Minimizing Finite Automata Is Computationally Hard.
Developments in Language Theory 2003: 386-397 |
| 3 | EE | Andreas Malcher:
On One-Way Cellular Automata with a Fixed Number of Cells.
Fundam. Inform. 58(2003): 355-368 (2003) |
| 2002 |
|---|
| 2 | EE | 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) |
