We show that the finite power properly is decidable for rational sets in free group. |
Moreover, the geometries axiomatized in the book have consistent and decidable extensions, namely, Euclidean or hyperbolic geometry over real-closed fields. |
A milestone open problem is to determine whether the equality of sequences generated by such automata is decidable. |
There are uncountably many subsets of N, but since there are only countably many Turing machines, there can be only countably many decidable sets. |
We prove that the existence of a coding between two trace monoids is decidable for some families of traces monoids. |
We prove here that the finite power property is decidable for rational sets of the free group. |