14 search results - page 2 / 3 » Variable Automata over Infinite Alphabets |
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
COMBINATORICA
2004
13 years 4 months ago
2004
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
CORR
2008
Springer
13 years 4 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...
LICS
2006
IEEE
13 years 10 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...