Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Malcher, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties
Martin Kutrib
,
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
,
Matthias Wendlandt
Theoretical Computer Science
578
, 2015, pp. 58-71
Head and state hierarchies for unary multi-head finite automata
Martin Kutrib
,
Andreas Malcher
,
Matthias Wendlandt
Acta Informatica
51
(8), 2014, pp. 553-569
Simulations of unary one-way multi-head finite automata
Martin Kutrib
,
Andreas Malcher
,
Matthias Wendlandt
International Journal of Foundations of Computer Science
25
(7), 2014, pp. 877-896
Stateless one-way multi-head finite automata with pebbles
Martin Kutrib
,
Andreas Malcher
,
Matthias Wendlandt
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1141-1159
Descriptional complexity of bounded context-free languages
Andreas Malcher
,
Giovanni Pighizzini
Information and Computation
227
, 2013, pp. 1-20
On the computational capacity of parallel communicating finite automata
Henning Bordihn
,
Martin Kutrib
,
Andreas Malcher
International Journal of Foundations of Computer Science
23
(3), 2012, pp. 713-732
First-order logics: Some characterizations and closure properties
Christian Choffrut
,
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
Acta Informatica
49
(4), 2012, pp. 225-248
Reversible pushdown automata
Martin Kutrib
,
Andreas Malcher
Journal of Computer and System Sciences
78
(6), 2012, pp. 1814-1827
Descriptional complexity of two-way pushdown automata with restricted head reversals
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
Theoretical Computer Science
449
, 2012, pp. 119-133
Undecidability and hierarchy results for parallel communicating finite automata
Henning Bordihn
,
Martin Kutrib
,
Andreas Malcher
International Journal of Foundations of Computer Science
22
(7), 2011, pp. 1577-1592
Complexity of multi-head finite automata: Origins and directions
Markus Holzer
,
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
412
(1-2), 2011, pp. 83-96
Cellular automata with limited inter-cell bandwidth
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
412
(30), 2011, pp. 3917-3931
Real-time reversible iterative arrays
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
411
(4-5), 2010, pp. 812-822
Cellular automata with sparse communication
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
411
(38-39), 2010, pp. 3516-3526
Sublinearly space bounded iterative arrays
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 843-858
Regulated nondeterminism in pushdown automata
Martin Kutrib
,
Andreas Malcher
,
Larissa Werlein
Theoretical Computer Science
410
(37), 2009, pp. 3447-3460
Computations and decidability of iterative arrays with restricted communication
Martin Kutrib
,
Andreas Malcher
Parallel Processing Letters
19
(2), 2009, pp. 247-264
The Boolean closure of linear context-free languages
Martin Kutrib
,
Andreas Malcher
,
Detlef Wotschke
Acta Informatica
45
(3), 2008, pp. 177-191
Fast reversible language recognition using cellular automata
Martin Kutrib
,
Andreas Malcher
Information and Computation
206
(9-10), 2008, pp. 1142-1151
Descriptional complexity of splicing systems
Remco Loos
,
Andreas Malcher
,
Detlef Wotschke
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 813-826
When Church-Rosser Becomes context free
Martin Kutrib
,
Andreas Malcher
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1293-1302
Context-dependent nondeterminism for pushdown automata
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
376
(1-2), 2007, pp. 101-111
On metalinear parallel communicating grammar systems
Andreas Malcher
,
Bettina Sunckel
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1313-1322
Fast iterative arrays with restricted inter-cell communication: Constructions and decidability
Martin Kutrib
,
Andreas Malcher
Lecture Notes in Computer Science
4162
, 2006, pp. 634-645
On two-way communication in cellular automata with a fixed number of cells
Andreas Malcher
Theoretical Computer Science
330
(2), 2005, pp. 325-338
Seiten 1
2
>