Results 1  10
of
16,816
Computable operators on regular sets
 Mathematical Logic Quarterly
, 2004
"... Key words Computability, recursive analysis, regular set, set operators. ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Key words Computability, recursive analysis, regular set, set operators.
On the Learnability of Infinitary Regular Sets
, 1994
"... In this paper we extend the automaton synthesis paradigm to infinitary languages, that is, to subsets of the set \Sigma ! of all infinite sequences over some alphabet \Sigma. Our main result is a polynomial algorithm for learning a subclass of the !regular sets from membership queries and counte ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
In this paper we extend the automaton synthesis paradigm to infinitary languages, that is, to subsets of the set \Sigma ! of all infinite sequences over some alphabet \Sigma. Our main result is a polynomial algorithm for learning a subclass of the !regular sets from membership queries
Entropy Regular Sets
, 1999
"... One of the objects of geometric measure theory is to derive global geometric structures from local properties (densities with respect to the sdimensional Hausdorff measure). In the framework of dynamical system it is more natural to consider entropy measures instead of Hausdorff measures. Our aim i ..."
Abstract
 Add to MetaCart
is to show that regular subshifts (with respect to the entropy measure) necessarily have a special rigid structure. Moreover, their entropy has to be the logarithm of an integer. This parallels the well known fact that regular sets (with respect to the Hausdorff measure) have to have integral dimension.
Regular Sets of Pomsets With Autoconcurrency
, 2002
"... Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of dierent kinds. We establish some interesting closure properties that allow us to relate ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of dierent kinds. We establish some interesting closure properties that allow us
Coding Partitions of Regular Sets *
"... Abstract A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions ..."
Abstract
 Add to MetaCart
that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing
Regular Sets of Matrices and Applications
"... Suppose A 1 ; \Delta \Delta \Delta ; A s are (1; \Gamma1) matrices of order m satisfying A i A j = J; i; j 2 f1; \Delta \Delta \Delta ; sg; (1) A T i A j = A T j A i = J; i 6= j; i; j 2 f1; \Delta \Delta \Delta ; sg; (2) s X i=1 (A i A T i +A T i A i ) = 2smIm ; (3) JA i = A i J = aJ; i = f1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
1; \Delta \Delta \Delta ; sg; a constant: (4) Call A 1 ; \Delta \Delta \Delta ; A s a regular sset of matrices of order m if (1), (2), (3) are satisfied and a regular sset of regular matrices if (4) is also satisfied, these matrices were first discovered by J. Seberry and A. L. Whiteman in "
THE UNIFORM REGULAR SET THEOREM IN
"... Several new features arise in the generalization of recursion theory on crl to recursion theory on admissible ordinals d, thus making ¿yrecursion theory an interesting theory. One of these is the appearance of irregular sets. A subset A of a is called regular (over a), if we have for all B<a tha ..."
Abstract
 Add to MetaCart
Several new features arise in the generalization of recursion theory on crl to recursion theory on admissible ordinals d, thus making ¿yrecursion theory an interesting theory. One of these is the appearance of irregular sets. A subset A of a is called regular (over a), if we have for all B
AhlforsDavid regular sets and bilipschitz
"... Abstract. Given two AhlforsDavid regular sets in metric spaces, we study the question whether one of them has a subset bilipschitz equivalent with the other. 1. ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. Given two AhlforsDavid regular sets in metric spaces, we study the question whether one of them has a subset bilipschitz equivalent with the other. 1.
Semiregular Sets of Matrices and Applications
"... The concept of semiregular sets of matrices was introduced by J. Seberry in "A new construction for Williamsontype matrices", Graphs and Combinatorics, 2(1986), 8187. A regular sset of matrices of order m was first discovered by J. Seberry and A. L. Whiteman in "New Hadamard matri ..."
Abstract
 Add to MetaCart
The concept of semiregular sets of matrices was introduced by J. Seberry in "A new construction for Williamsontype matrices", Graphs and Combinatorics, 2(1986), 8187. A regular sset of matrices of order m was first discovered by J. Seberry and A. L. Whiteman in "New Hadamard
Results 1  10
of
16,816