Let L be an infinite regular language on a totally ordered alphabet (Σ, <). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of k-automatic sequence for abstract numeration systems on a regular language (instead of...

Process types specify sequences of acceptable messages. Even if the set of acceptable messages changes dynamically, a type checker can statically ensure that only acceptable messages are sent. As proposed so far, all message sequence sets speciied by types can be generated by regular grammars. We propose to increase the expressiveness so that non-regular message sequence sets can be speciied. T...

Suppose V ⊆ W are models of ZFC with the same ordinals, and that for all regular cardinals κ in W , V satisfies κ. If W \ V contains a sequence r : ω → γ for some ordinal γ, then for all cardinals κ < λ in W with κ regular in W and λ ≥ γ, (Pκ(λ)) \ V is stationary in (Pκ(λ)) . That is, a new ω-sequence achieves global co-stationarity of the ground model.

Let ρ : G GL(n, IF) be a representation of a finite group over the field IF of characteristic p, and h1 , . . . , hm ∈IF[V ]G ivariant polynomials that form a regular sequence in IF[V ]. In this note we introduce a tool to study the problem of whether they form a regular sequence in IF[V ]G. Examples show they need not. We define the cohomology of G with coefficients in the Koszul complex

Weconsider the Pottsmodelwith q colors on a sequence ofweighted graphs with adjacency matrices An , allowing for both positive and negative weights. Under a mild regularity condition on An we show that the mean-field prediction for the log partition function is asymptotically correct, whenever tr(An) = o(n). In particular, our results are applicable for the Ising and the Potts models on any seq...

Given any self-adjoint realization S of a singular Sturm-Liouville (S-L) problem, it is possible to construct a sequence {Sr} of regular S-L problems with the properties (i) every point of the spectrum of S is the limit of a sequence of eigenvalues from the spectrum of the individual members of {Sr} (ii) in the case when S is regular or limit-circle at each endpoint, a convergent sequence of ei...

This paper mainly treats of the interconnections between the periodic Schur form and its associated periodical deflating subspaces. We establish some equivalent statements of the periodic Schur decomposition for regular periodic matrix pairs. Based on these equivalences, we define the eigenspaces for regular periodic matrix pairs, and point out the corresponding eigenvalues inherited from a giv...

A random vector X with representation X = ∑ j≥0 AjZj is considered. Here, (Zj) is a sequence of independent and identically distributed random vectors and (Aj) is a sequence of random matrices, ‘predictable’ with respect to the sequence (Zj). The distribution of Z1 is assumed to be multivariate regular varying. Moment conditions on the matrices (Aj) are determined under which the distribution o...

We construct a model where every increasing ω-sequence of regular cardinals carries a mutually stationary sequence which is not tightly stationary, and show that this property is preserved under a class of Prikry-type forcings. Along the way, we give examples in the Cohen and Prikry models of ω-sequences of regular cardinals for which there is a non-tightly stationary sequence of stationary sub...

Regular expression signatures are most widely used in network traffic classification for trusted network management. These signatures are generated by the sequence alignment of the traffic payload. The most commonly used sequence alignment algorithm is Longest Common Subsequence (LCS) algorithm which computes the global similarity between two strings but it fails in consecutive character matche...