Kutrib, Martin
165  results:
?
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

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

Lecture Notes in Computer Science, 13960
Kutrib, Martin ; Meyer, Uwe - 1st ed. 2023 . , 2023
 
?
5

State complexity of finite partial languages:

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

Tree-Walking-Storage Automata:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
Kutrib, Martin ; Meyer, Uwe - p. 182-194 , 2023
 
?
7

Syntax checking either way:

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

Complexity of Exclusive Nondeterministic Finite Automata:

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

Sweeping Input-Driven Pushdown Automata:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
Kutrib, Martin - p. 194-205 , 2023
 
?
12

Variants of string assembling systems:

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

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

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
 
?
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
 
?
15

Syntax Checking Either Way:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
Kutrib, Martin ; Meyer, Uwe - p. 128-139 , 2022
 
1-15