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

Autor: Bertrand, Clément, Di Giusto, Cinzia, Klaudel, Hanna, Regnault, Damien

We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory

Externí odkaz: http://arxiv.org/abs/2307.03561

Layered Memory Automata: Recognizers for Quasi-Regular Languages with Unbounded Memory

Autor: Bertrand, Clément, Klaudel, Hanna, Peschanski, Frédéric

Publikováno v: Application and Theory of Petri Nets and Concurrency ISBN: 9783031066528
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022)
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022), Jun 2022, Bergen, Norway. pp.43--63, ⟨10.1007/978-3-031-06653-5_3⟩

International audience; This paper presents the model of Layered Memory Automata (LaMA) to deal with languages involving infinite alphabets, with practical applications in the analysis of datastreams, or modeling complex resource usages in concurrent

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1c74d4616af96e69a0ed263910fc4cd
https://doi.org/10.1007/978-3-031-06653-5_3

Matching of dynamic patterns with timed memory automata

Autor: Bertrand, Clément

Publikováno v: Traitement du signal et de l'image [eess.SP]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG034⟩

The globalized and increasing use of computers and the Internet have for consequences an always increasing quantity of data and online communications. Some examples of this data can be logs of social networks messages of Internet routers usages. Such

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::8d08b26a0734e03f7e17f1d60749425d
https://tel.archives-ouvertes.fr/tel-03172600/document