118 search results - page 14 / 24 » Ordinal computations |
MFCS
2001
Springer
14 years 2 days ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
Publication
We propose a methodology for anonymization of records by aggregating sequential records. This methodology is applied to real valued, binary, nominal and ordinal data. We propose tw...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...