Pattern matching in link streams: timed-automata with finite memory

DOI10.7561/SACS.2018.2.161MaRDI QIDQ4621222zbMATH OpenWikidataFDO

Authors Clément Bertrand, Hanna Klaudel, Matthieu Latapy, Frédéric Peschanski

Publication date 8 February 2019

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7561/SACS.2018.2.161

zbMATH Keywords

complex networkstimed automatalink streamsfinite-memory automatatimed pattern recognitiondifference bound matrices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Algorithms on strings (68W32)

Recommendations

• Pattern matching in link streams: a token-based approach
• Online timed pattern matching using automata
• Enumerating maximal cliques in link streams with durations
• Computing maximal cliques in link streams
• Temporal matching

Cited in

(3)

• Complexity of membership and non-emptiness problems in unbounded memory automata
• Layered memory automata: recognizers for quasi-regular languages with unbounded memory
• Pattern matching in link streams: a token-based approach

This page was built for publication: Pattern matching in link streams: timed-automata with finite memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621222)