Search results for "Data type"
showing 10 items of 1183 documents
On Automaton Recognizability of Abnormal Extremals
2002
For a generic single-input planar control system $\dot x=F(x)+ u G(x),$ $x\in\mathbb{R}^2,$ $u\in [-1,1]$, $F(0)=0$, we analyze the properties of abnormal extremals for the minimum time stabilization to the origin. We prove that abnormal extremals are finite concatenations of bang arcs with switchings occurring on the set in which the vector fields F and G are collinear. Moreover, all the generic singularities of one parametric family of extremal trajectories near to abnormal extremals are studied. In particular, we prove that all possible sequences of these singularities, and hence all generic abnormal extremals, can be classified by a set of words recognizable by an automaton.
Some Remarks on Automata Minimality
2011
It is well known that the minimization problem of deterministic finite automata (DFAs) is related to the indistinguishability notion of states (cf. [HMU00]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or indistinguishable), namely pairs of states (p,q) such that it is impossible to assert the difference between p and q only by starting in each of the two states and asking whether or not a given input string leads to a final state. Since, in the testing states equivalence, the notion of initial state is irrelevant, some of the main techniques for the minimization of automata, such as Moore’s algorithm [Moo56] and Ho…
Binary Patterns in Infinite Binary Words
2002
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…
Some Generalizations of a Simion Schmidt Bijection
2007
In 1985, Simion and Schmidt gave a constructive bijection φ from the set of all length (n-1) binary strings having no two consecutive 1s to the set of all length n permutations avoiding all patterns in {123,132,213}. In this paper, we generalize φ to an injective function from {0,1}n-1 to the set Sn of all length n permutations and derive from it four bijections φ : P →Q where P⊆{0,1}n-1 and Q ⊂ Sn. The domains are sets of restricted binary strings and the codomains are sets of pattern-avoiding permutations. As a particular case we retrieve the original Simion–Schmidt bijection. We also show that the bijections obtained are actually combinatorial isomorphisms, i.e. closeness-preserving bije…
Closedness Properties in EX-Identification of Recursive Functions
1998
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n - 1 classes out of U1;, . . ., Un is identifiable, so is the union of all n classes; 2) there are such classes U1;, . . ., Un-1 that every union of n-2 classes out of them is identifiable, while the union of n - 1 classes is not. We show that by finding these n we can distinguish which requirements put on the iden…
Unions of identifiable families of languages
1996
This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.
Bernstein sets andκ-coverings
2010
䅢stract. In this paper we study a notion of a �-covering in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings. 1. Definitions and notation In 1993 Car汳on 楮 h楳 paper 嬳] 楮troduced a not楯n of �-cover楮gs and used 楴 for 楮vest楧at楮g whether some 楤ea汳 are or are not �-trans污tab汥. Later on �-cover楮gs were stud楥d by other authors, e. Muthuvel (cf. [7 崩 and Now楫 (cf. 嬸崬 嬹崩. In th楳 paper we present new resu汴s on �-cover楮gs 楮 connect楯n w楴h Bernste楮 sets. We a汳o 楮troduce two natural genera汩zat楯ns of the not楯n of �-cover楮gs, name汹 �-S-cover楮gs and �-I-cover楮gs. We use …
The set of conjugacy class sizes of a finite group does not determine its solvability
2014
Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.
Maximal subgroups and formations
1989
Abstract We define, in each finite group G , some subgroups of Frattini-type in relation with a saturated formation and with a set of primes and study their properties, especially their influence in the structure of G .
Nilpotent and perfect groups with the same set of character degrees
2014
We find a pair of finite groups, one nilpotent and the other perfect, with the same set of character degrees.