A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Regular Expressions for Data Words
[chapter]
2012
Lecture Notes in Computer Science
In this paper we define and study regular expressions for data words. We first define regular expression with memory (REM), which extend standard regular expressions with limited memory and show that they capture the class of data words defined by register automata. We also study the complexity of the standard decision problems for REM, which turn out to be the same as for register automata. In order to lower the complexity of main reasoning tasks, we then look at two natural subclasses of REM
doi:10.1007/978-3-642-28717-6_22
fatcat:rfuxmrqyobcmnld33hxxq5bi5q