Search the dblp DataBase

Publications of Author

1. Andreas Malcher
   Minimizing Finite Automata Is Computationally Hard. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2003, pp:386-397 [Conf]
   
2. Martin Kutrib, Andreas Malcher
   Context-Dependent Nondeterminism for Pushdown Automata. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2006, pp:133-144 [Conf]
   
3. Martin Kutrib, Andreas Malcher, Detlef Wotschke
   The Boolean Closure of Linear Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2004, pp:284-295 [Conf]
   
4. Martin Kutrib, Andreas Malcher
   Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. [Citation Graph (0, 0)][DBLP]
   MFCS, 2006, pp:634-645 [Conf]
   
5. Andreas Malcher
   On One-Way Cellular Automata with a Fixed Number of Cells. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2003, v:58, n:2003, pp:355-368 [Journal]
   
6. Andreas Malcher
   Descriptional Complexity of Cellular Automata and Decidability Questions. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:549-560 [Journal]
   
7. Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
   Descriptional Complexity of Machines with Limited Resources. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2002, v:8, n:2, pp:193-234 [Journal]
   
8. Andreas Malcher
   Minimizing finite automata is computationally hard. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:375-390 [Journal]
   
9. Andreas Malcher
   On two-way communication in cellular automata with a fixed number of cells. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:325-338 [Journal]
   
10. Martin Kutrib, Andreas Malcher
    Context-dependent nondeterminism for pushdown automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:101-111 [Journal]
    
11. Andreas Malcher, Giovanni Pighizzini
    Descriptional Complexity of Bounded Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:312-323 [Conf]
    
12. Martin Kutrib, Andreas Malcher
    Real-Time Reversible Iterative Arrays. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:376-387 [Conf]
    
13. Martin Kutrib, Andreas Malcher, Larissa Werlein
    Regulated Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:85-96 [Conf]
    
14. Martin Kutrib, Andreas Malcher
    Finite turns and the regular closure of linear context-free languages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2152-2164 [Journal]
    
15. 
    On the Computational Capacity of Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]
    
    
16. 
    Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]
    
    
17. 
    Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. [Citation Graph (, )][DBLP]
    
    
18. 
    Cellular Automata with Sparse Communication. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Expressive Power of FO[ + ]. [Citation Graph (, )][DBLP]
    
    
20. 
    Reversible Pushdown Automata. [Citation Graph (, )][DBLP]
    
    
21. 
    The Boolean closure of linear context-free languages. [Citation Graph (, )][DBLP]
    
    
22. 
    Descriptional complexity of bounded context-free languages [Citation Graph (, )][DBLP]
    
    
23. 
    Multi-Head Finite Automata: Characterizations, Concepts and Open Problems [Citation Graph (, )][DBLP]
    
    
24. 
    Bounded Languages Meet Cellular Automata with Sparse Communication [Citation Graph (, )][DBLP]
    
    
25. 
    Remembering Chandra Kintala [Citation Graph (, )][DBLP]
    
    
26. 
    On One-way One-bit O (One)-message Cellular Automata. [Citation Graph (, )][DBLP]