Linear splicing and syntactic monoid

Splicing systems were introduced by Head in 1987 as a formal counterpart of a biological mechanism of DNA recombination under the action of restriction and ligase enzymes. Despite the intensive studies on linear splicing systems, some elementary questions about their computational power are still open. In particular, in this paper we face the problem of characterizing the proper subclass of regular languages which are generated by finite (Paun) linear splicing systems. We introduce here the class of marker languages L, i.e., regular languages with the form L=L₁[x]₁L₂, where L₁,L₂ are regular languages, [x] is a syntactic congruence class satisfying special conditions and [x]₁ is either equal to [x] or equal to [x]∪{1}, 1 being the empty word. Using classical properties of formal language theory, we give an algorithm which allows us to decide whether a regular language is a marker language. Furthermore, for each marker language L we exhibit a finite Paun linear splicing system and we prove that this system generates L.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Piecewise testable languages via combinatorics on words

A regular language L over an alphabet A is called piecewise testable if it is a finite Boolean combination of languages of the form A^∗a₁A^∗a₂A^∗…A^∗a_?A^∗, where a₁,…,a_?∈A, ?≥0. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J-trivial. Nowadays, there exist several proofs of this result based on various methods from algebraic theory of regular languages. Our contribution adds a new purely combinatorial proof.     

The basis automaton for the given regular language

A new problem of the theory of finite automata (Rabin-Scott’s automata) is considered. So called basis automaton for the given regular languageL is defined. This automaton is unique for the givenL, it is defined by two automata of canonical form: forL and for its inverse languageL ^R. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks, dealing with the given regular language.     

Symmetries that latin squares inherit from 1‐factorizations

A 1‐factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. There is a well‐known method, which we call the ??‐construction, for building a 1‐factorization of K_n,n from a 1‐factorization of K_{n + 1}. The 1‐factorization of K_n,n can be written as a latin square of order n. The ??‐construction has been used, among other things, to make perfect 1‐factorizations, subsquare‐free latin squares, and atomic latin squares. This paper studies the relationship between the factorizations involved in the ??‐construction. In particular, we show how symmetries (automorphisms) of the starting factorization are inherited as symmetries by the end product, either as automorphisms of the factorization or as autotopies of the latin square. Suppose that the ??‐construction produces a latin square L from a 1‐factorization F of K_{n + 1}. We show that the main class of L determines the isomorphism class of F, although the converse is false. We also prove a number of restrictions on the symmetries (autotopies and paratopies) which L may possess, many of which are simple consequences of the fact that L must be symmetric (in the usual matrix sense) and idempotent. In some circumstances, these restrictions are tight enough to ensure that L has trivial autotopy group. Finally, we give a cubic time algorithm for deciding whether a main class of latin squares contains any square derived from the ??‐construction. The algorithm also detects symmetric squares and totally symmetric squares (latin squares that equal their six conjugates). © 2005 Wiley Periodicals, Inc. J Combin Designs 13: 157–172, 2005.     

Unitary couplings,scattering suboperators and regular factorizations of bounded operator valued functions II

In the paper bilateral shifts are studied which generate factorizations of unitary couplings (in the system theory they play the part of channels). Subspaces of L²(??), reducing the multiplication operator by e^it, are investigated in the channel language. New criteria for regular divisibility of contractive operator functions in the class L^∞ are obtained. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the spectrum of critical sets in latin squares of order 2n

Suppose that L is a latin square of order m and P ? L is a partial latin square. If L is the only latin square of order m which contains P, and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a partial solution to the critical set spectrum problem for latin squares of order 2ⁿ. The back circulant latin square of even order m has a well‐known critical set of size m²/4, and this is the smallest known critical set for a latin square of order m. The abelian 2‐group of order 2ⁿ has a critical set of size 4ⁿ‐3ⁿ, and this is the largest known critical set for a latin square of order 2ⁿ. We construct a set of latin squares with associated critical sets which are intermediate between the back circulant latin square of order 2ⁿ and the abelian 2‐group of order 2ⁿ. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 25–43, 2008     

Near‐automorphisms of Latin squares

We define a near‐automorphism α of a Latin square L to be an isomorphism such that L and α L differ only within a 2 × 2 subsquare. We prove that for all n≥2 except n∈{3, 4}, there exists a Latin square which exhibits a near‐automorphism. We also show that if α has the cycle structure (2, n ? 2), then L exists if and only if n≡2 (mod 4), and can be constructed from a special type of partial orthomorphism. Along the way, we generalize a theorem by Marshall Hall, which states that any Latin rectangle can be extended to a Latin square. We also show that if α has at least 2 fixed points, then L must contain two disjoint non‐trivial subsquares. Copyright © 2011 John Wiley & Sons, Ltd. 19:365‐377, 2011     

The modal logic of continuous functions on the rational numbers

Let L^\square°{{\mathcal L}^{\square\circ}} be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality □ and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L^\square°{{\mathcal L}^{\square\circ}} by interpreting L^\square°{{\mathcal L}^{\square\circ}} in dynamic topological systems, i.e., ordered pairs 〈X, f〉, where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown that S4C is sound and complete for this semantics. S4C is also complete for continuous functions on Cantor space (Mints and Zhang, Kremer), and on the real plane (Fernández Duque); but incomplete for continuous functions on the real line (Kremer and Mints, Slavnov). Here we show that S4C is complete for continuous functions on the rational numbers.     

Recognizing splicing languages: Syntactic monoids and simultaneous pumping

We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular language is a reflexive splicing language, but the general question remains open.     

Uniform superconvergence of a Galerkin finite element method on Shishkin‐type meshes

We consider a Galerkin finite element method that uses piecewise bilinears on a class of Shishkin‐type meshes for a model singularly perturbed convection‐diffusion problem on the unit square. The method is shown to be convergent, uniformly in the diffusion parameter ϵ, of almost second order in a discrete weighted energy norm. As a corollary, we derive global L₂‐norm error estimates and local L_∞‐norm estimates. Numerical experiments support our theoretical results. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16:426–440, 2000     

Do there exist complete sets for promise classes?

In this paper we investigate the following two questions:

相似文献   

Metrically Universal Generic Structures in Free Amalgamation Classes

We prove that each ∀₁ free amalgamation class K over a finite relational language L admits a countable generic structure M isometrically embedding all countable structuresin K relative to a fixed metric. We expand L by infinitely many binary predicates expressingdistance, and prove that the resulting expansion of K has a model companion axiomatizedby the first‐order theory of M. The model companion is non‐finitely axiomatizable, evenover a strong form of the axiom scheme of infinity.     

On String Replacement Exponentiation

The string replacement (SR) method was recently proposed as a methodfor exponentiation a ^e in a group G. The canonicalk-SR method operates by replacing a run of i onesin a binary exponent,0k, with i-1 zeroes followedby the single digit b=2 ⁱ -1. After recoding, it was shown in[5] that the expected weight of e tends to n/4 forn-bit exponents. In this paper we show that the canonicalk-SR recoding process can be described as a regular language andthen use generating functions to derive the exact probability distribution ofrecoded exponent weights. We also show that the canonical 2-SR recodingproduces weight distributions very similar to (optimal) signed-digitrecodings, but no group inversions are required.     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The geometry of t‐spreads in k‐walk‐regular graphs

A graph is walk‐regular if the number of closed walks of length ? rooted at a given vertex is a constant through all the vertices for all ?. For a walk‐regular graph G with d+1 different eigenvalues and spectrally maximum diameter D=d, we study the geometry of its d‐spreads, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a simplex (or tetrahedron in a three‐dimensional case) and we compute its parameters. Moreover, the results are generalized to the case of k‐walk‐regular graphs, a family which includes both walk‐regular and distance‐regular graphs, and their t‐spreads or vertices at distance t from each other. © 2009 Wiley Periodicals, Inc. J Graph Theory 64:312–322, 2010     

Generalized periodicity and primitivity for words

Starting from six kinds of periodicity of words we define six sets of words which are primitive in different senses and we investigate their relationships. We show that only three of the sets are external Marcus contextual languages with choice but none of them is an external contextual language without choice or an internal contextual language. For the time complexity of deciding any of our sets by one-tape Turing machines, n ² is a lower bound and this is optimal in two cases. The notions of roots and degrees of words and languages, which are strongly connected to periodicity and primitivity, are also considered, and we show that there can be an arbitrarily large gap between the complexity of a language and that of its roots. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on morphic characterization of languages

It is noted, by using ideas of Culik, Fich and Salomaa [3], that for each language L and each regular language R the language L ∩ R is obtained from L# by applying the operation ‘a morphism followed by an inverse morphism' twice. As a consequence new purely morphic characterizations, based on the Dyck language D₂ and the twin-shuffle language L₂, are derived for the families of context-free and recursively enumerable languages, respectively. Also a morphic representation result for rational transductions follows.     

Sur la suite de polynômes orthogonaux associée à la formeu=δ c +λ(x−c) −1 L

We show that, ifL is regular, semi-classical functional, thenu is also regular and semi-classical for every complex λ, except for a discrete set of numbers depending onL andc. We give the second order linear differential equation satisfied by each polynomial of the orthogonal sequence associated withu. The cases whereL is either a classical functional (Hermite, Laguerre, Bessel, Jacobi) or a functional associated with generalized Hermite polynomials are treated in detail.

     

Regular solutions to the coagulation equations with singular kernels

In this article, we prove the existence of solutions to the coagulation equation with singular kernels. We use weighted L¹‐spaces to deal with the singularities in order to obtain regular solutions. The Smoluchowski kernel is covered by our proof. The weak L¹ compactness methods are applied to suitably chosen approximating equations as a base of our proof. A more restrictive uniqueness result is also mentioned. Copyright © 2014 John Wiley & Sons, Ltd.