E-LIB Suche - Ergebnisse für: Kutrib, Martin

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

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

Syntax checking either way:

Kutrib, Martin ; Meyer, Uwe
Theoretical Computer Science. 966-967 (2023) - p. 114000 , 2023

Link: https://doi.org/10.1016/..

4

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/..

5

Tree-Walking-Storage Automata:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Kutrib, Martin ; Meyer, Uwe - p. 182-194 , 2023

Link: https://doi.org/10.1007/..

6

Complexity of Exclusive Nondeterministic Finite Automata:

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

Kutrib, Martin ; Malcher, Andreas ; Wendlandt, Matthias - p. 121-133 , 2023

Link: https://doi.org/10.1007/..

7

Reversible Computation: 15th International Conference, RC 2..

Lecture Notes in Computer Science, 13960

Kutrib, Martin ; Meyer, Uwe - 1st ed. 2023 . , 2023

Link: https://doi.org/10.1007/..

8

Sweeping Input-Driven Pushdown Automata:

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

Kutrib, Martin - p. 194-205 , 2023

Link: https://doi.org/10.1007/..

9

State complexity of finite partial languages:

Kutrib, Martin ; Wendlandt, Matthias
Theoretical Computer Science. 966-967 (2023) - p. 114001 , 2023

Link: https://doi.org/10.1016/..

10

Syntax Checking Either Way:

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

Kutrib, Martin ; Meyer, Uwe - p. 128-139 , 2022

Link: https://doi.org/10.1007/..

11

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/..

12

Optimizing Reversible Programs:

, In: Reversible Computation; Lecture Notes in Computer Science,

Deworetzki, Niklas ; Kutrib, Martin ; Meyer, Uwe. - p. 224-238 , 2022

Link: https://doi.org/10.1007/..

13

Variants of string assembling systems:

Kutrib, Martin ; Wendlandt, Matthias
Natural Computing. 23 (2022) 1 - p. 131-156 , 2022

Link: https://doi.org/10.1007/..

14

State Complexity of Finite Partial Languages:

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

Kutrib, Martin ; Wendlandt, Matthias - p. 170-183 , 2022

Link: https://doi.org/10.1007/..

15

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/..