On the complexity of timed pattern matching
type: Item
instance of: scholarly article
title: On the complexity of timed pattern matching
DOI: 10.1007/978-3-030-85037-1_2
author: Eugene Asarin
author: Thomas Ferrère
author: Dejan Ničković
author: Dogan Ulus
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7497998
zbMATH Keywords: timed regular expressions
zbMATH Keywords: pattern matching
zbMATH Keywords: complexity
Wikidata QID: Q124213265
describes a project that uses: timed-pattern-matching
describes a project that uses: Montre
MaRDI profile type: Publication
full work available at URL: 978-3-030-85037-1 2
OpenAlex ID: W3196175986
cites work: A theory of timed automata
cites work: Timed regular expressions
cites work: On the quantitative semantics of regular expressions over real-valued signals
cites work: Online timed pattern matching using automata
cites work: Q4514735
cites work: Real-time automata
cites work: Carathéodory bounds for integer cones
cites work: Reachability in two-clock timed automata is PSPACE-complete
cites work: Q3862379
cites work: Q4736867
cites work: Linear Arithmetic with Stars
cites work: Q4131648
cites work: Timed Pattern Matching
cites work: Online timed pattern matching using derivatives
cites work: A Boyer-Moore Type Algorithm for Timed Pattern Matching
cites work: Efficient online timed pattern matching by automata-based skipping
description: scientific article; zbMATH DE number 7497998