64 search results - page 4 / 13 » Computability of Countable Subshifts |
202
Voted
MFCS
2001
Springer
15 years 12 months 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...
177
Voted
DLT
2009
15 years 5 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
148
Voted
STACS
2005
Springer
16 years 27 days ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
192
Voted
AUTOMATICA
2008
15 years 7 months ago
2008
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...
162
click to vote
IJBC
2002
15 years 7 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...