Amanote Research

Amanote Research

    RegisterSign In

Pattern Matching in Link Streams: Timed-Automata With Finite Memory

Scientific Annals of Computer Science - Romania
doi 10.7561/sacs.2018.2.161
Full Text
Open PDF
Abstract

Available in full text

Categories
Applied MathematicsComputer Science
Date

September 25, 2018

Authors
Clement BertrandFrederic PeschanskiHanna KlaudelMatthieu Latapy
Publisher

Scientific Annals of Computer Science


Related search

Online Timed Pattern Matching Using Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Discrete Timed Automata

English

Frequencies in Forgetful Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Matching of Twig Pattern With AND/OR Predicates Over XML Streams

Design, Performance, and Analysis of Innovative Information Retrieval
2013English

Distributed Timed Automata With Independently Evolving Clocks

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy