7 search results - page 1 / 2 » Automata vs. Logics on Data Words |
CSL
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...