Malcher, Andreas
125  results:
Search for persons X
?
2

Reversible Computations of One-Way Counter Automata:

Kutrib, Martin ; Malcher, Andreas ; Bordihn, H...
RAIRO - Theoretical Informatics and Applications.  58 (2024)  - p. 5 , 2024
 
?
4

Complexity of Exclusive Nondeterministic Finite Automata:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
 
?
8

On the Power of Pushing or Stationary Moves for Input-Drive..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
 
?
11

One-Dimensional Pattern Generation by Cellular Automata:

, In: Lecture Notes in Computer Science; Cellular Automata,
Kutrib, Martin ; Malcher, Andreas - p. 46-55 , 2021
 
?
12

Digging input-driven pushdown automata:

Kutrib, Martin ; Malcher, Andreas ; Holzer, Markus.
RAIRO - Theoretical Informatics and Applications.  55 (2021)  - p. 6 , 2021
 
?
13

Reversible pushdown transducers:

Guillon, Bruno ; Kutrib, Martin ; Malcher, Andreas.
Information and Computation.  281 (2021)  - p. 104813 , 2021
 
?
14

Input-driven multi-counter automata:

Kutrib, Martin ; Malcher, Andreas ; Wendlandt, Matthias
Theoretical Computer Science.  870 (2021)  - p. 121-136 , 2021
 
?
15

Iterated Uniform Finite-State Transducers on Unary Language:

, In: SOFSEM 2021: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
 
1-15