activity
20072024
most citedBoolean networks synchronism sensitivity and XOR circulant networks convergence time

7 citations · 17 across the 12 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.FL2023

Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata

Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel +1

We study the complexity relationship between three models of unbounded memory automata: nu-automata (-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). Thes…