2465 search results - page 27 / 493 » Automata on Linear Orderings |
FUIN
2010
13 years 5 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
MST
2011
13 years 2 months ago
2011
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
NDJFL
1998
13 years 7 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
ORDER
2002
13 years 7 months ago
2002
We show that: (1) For many regular cardinals (in particular, for all successors of singular strong limit cardinals, and for all successors of singular -limits), for all n {2, 3, ...