I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Malcher, Andreas
39
results:
Articles (Online) X
Search for persons
X
Languages
english (36)
german (1)
Sorted by: Relevance
Sorted by: Year
?
1
On the power of pushing or stationary moves for input-drive..:
Kutrib, Martin
;
Malcher, Andreas
;
Wendlandt, Matthias
Theoretical Computer Science. 996 (2024) - p. 114503 , 2024
Link:
https://doi.org/10.1016/..
?
2
Reversible Computations of One-Way Counter Automata:
Kutrib, Martin
;
Malcher, Andreas
;
Bordihn, H.
..
RAIRO - Theoretical Informatics and Applications. 58 (2024) - p. 5 , 2024
Link:
https://doi.org/10.1051/..
?
3
Iterated uniform finite-state transducers on unary language:
Kutrib, Martin
;
Malcher, Andreas
;
Mereghetti, Carlo
.
Theoretical Computer Science. 969 (2023) - p. 114049 , 2023
Link:
https://doi.org/10.1016/..
?
4
Herausforderungen und Perspektiven bei der BIM‐Planung von ..:
Malcher, Andreas
;
Saliba, Alain
;
Wolgast, Eric
Bautechnik. 100 (2023) 7 - p. 396-405 , 2023
Link:
https://doi.org/10.1002/..
?
5
Descriptional complexity of iterated uniform finite-state t..:
Kutrib, Martin
;
Malcher, Andreas
;
Mereghetti, Carlo
.
Information and Computation. 284 (2022) - p. 104691 , 2022
Link:
https://doi.org/10.1016/..
?
6
One-dimensional pattern generation by cellular automata:
Kutrib, Martin
;
Malcher, Andreas
Natural Computing. 21 (2022) 3 - p. 361-375 , 2022
Link:
https://doi.org/10.1007/..
?
7
Finite automata with undirected state graphs:
Kutrib, Martin
;
Malcher, Andreas
;
Schneider, Christian
Acta Informatica. 59 (2021) 1 - p. 163-181 , 2021
Link:
https://doi.org/10.1007/..
?
8
Digging input-driven pushdown automata:
Kutrib, Martin
;
Malcher, Andreas
;
Holzer, Markus
.
RAIRO - Theoretical Informatics and Applications. 55 (2021) - p. 6 , 2021
Link:
https://doi.org/10.1051/..
?
9
Preface to Martin Kutrib Festschrift:
Fernau, Henning
;
Malcher, Andreas
;
Pighizzini, Giovanni
Acta Informatica. 58 (2021) 4 - p. 241-242 , 2021
Link:
https://doi.org/10.1007/..
?
10
Input-driven multi-counter automata:
Kutrib, Martin
;
Malcher, Andreas
;
Wendlandt, Matthias
Theoretical Computer Science. 870 (2021) - p. 121-136 , 2021
Link:
https://doi.org/10.1016/..
?
11
Reversible pushdown transducers:
Guillon, Bruno
;
Kutrib, Martin
;
Malcher, Andreas
.
Information and Computation. 281 (2021) - p. 104813 , 2021
Link:
https://doi.org/10.1016/..
?
12
Iterative arrays with finite inter-cell communication:
Kutrib, Martin
;
Malcher, Andreas
Natural Computing. 21 (2020) 1 - p. 3-15 , 2020
Link:
https://doi.org/10.1007/..
?
13
Transducing reversibly with finite state machines:
Kutrib, Martin
;
Malcher, Andreas
;
Wendlandt, Matthias
Theoretical Computer Science. 787 (2019) - p. 111-126 , 2019
Link:
https://doi.org/10.1016/..
?
14
Hierarchies and undecidability results for iterative arrays..:
Malcher, Andreas
Natural Computing. 19 (2019) 4 - p. 797-809 , 2019
Link:
https://doi.org/10.1007/..
?
15
One-way reversible multi-head finite automata:
Kutrib, Martin
;
Malcher, Andreas
Theoretical Computer Science. 682 (2017) - p. 149-164 , 2017
Link:
https://doi.org/10.1016/..
1-15