Matching Regular Expressions on uncertain data

In this paper we study regular expression matching in cases in which the identity of the symbols received is subject to uncertainty. We develop a model of symbol emission and uses a modification of the shortest path algorithm to find optimal matches on the Cartesian Graph of an expression provided t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algorithmica Jg. 84; H. 2; S. 532 - 564
Hauptverfasser: Gil, José Arturo, Santini, Simone
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.02.2022
Springer Nature B.V
Schlagworte:
Algorithm Analysis and Problem Complexity
Algorithms
Cartesian coordinates
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Matching
Mathematics of Computing
Shortest-path problems
Symbols
Theory of Computation
Uncertainty
Event detection
Noisy data
Regular expression
ISSN:0178-4617, 1432-0541
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we study regular expression matching in cases in which the identity of the symbols received is subject to uncertainty. We develop a model of symbol emission and uses a modification of the shortest path algorithm to find optimal matches on the Cartesian Graph of an expression provided that the input is a finite list. In the case of infinite streams, we show that the problem is in general undecidable but, if each symbols is received with probability 0 infinitely often, then with probability 1 the problem is decidable.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-021-00906-8