303 search results - page 37 / 61 » Automata on Gauss Words |
CORR
2008
Springer
13 years 9 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...
ENTCS
2006
13 years 9 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
JUCS
2002
13 years 9 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
TCS
2010
13 years 4 months ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...