26 search results - page 2 / 6 » dlt 2008 |
DLT
2008
13 years 6 months ago
2008
DLT
2008
13 years 6 months ago
2008
DLT
2008
13 years 6 months ago
2008
Abstract. Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b} . Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a ...
DLT
2008
13 years 6 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
DLT
2008
13 years 6 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...