ON LANGUAGES FACTORIZING THE FREE MONOID

1996 ◽  
Vol 06 (04) ◽  
pp. 413-427 ◽  
Author(s):  
MARCELLA ANSELMO ◽  
ANTONIO RESTIVO
Keyword(s):  
General Result ◽  
Regular Language ◽  
Regular Expression ◽  
Free Monoid ◽  
Complete Characterization ◽  
Regular Languages ◽  
Combinatorial Characterization

A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous. First we give a combinatorial characterization of factorizing languages. Further we prove that it is decidable whether a regular language X is factorizing and we construct an automaton recognizing the corresponding language Y. For finite languages we show that it suffices to consider words of bounded length. A complete characterization of factorizing languages with three words and explicit regular expression for the corresponding language Y are also given. Finally we prove a more general result stating that, given two regular languages X and T, it is decidable whether there exists a language Y such that XY=T and the product is unambiguous.

Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages

2021 ◽  
pp. 1-23
Author(s):  
Benedek Nagy
Keyword(s):  
Normal Form ◽  
Regular Language ◽  
Regular Expression ◽  
Finite Automata ◽  
Finite Union ◽  
Regular Languages ◽  
Regular Expressions ◽  
Closure Properties ◽  
Language Class ◽  
Union Operation

Union-free expressions are regular expressions without using the union operation. Consequently, (nondeterministic) union-free languages are described by regular expressions using only concatenation and Kleene star. The language class is also characterised by a special class of finite automata: 1CFPAs have exactly one cycle-free accepting path from each of their states. Obviously such an automaton has exactly one accepting state. The deterministic counterpart of such class of automata defines the deterministic union-free (d-union-free, for short) languages. In this paper [Formula: see text]-free nondeterministic variants of 1CFPAs are used to define n-union-free languages. The defined language class is shown to be properly between the classes of (nondeterministic) union-free and d-union-free languages (in case of at least binary alphabet). In case of unary alphabet the class of n-union-free languages coincides with the class of union-free languages. Some properties of the new subregular class of languages are discussed, e.g., closure properties. On the other hand, a regular expression is in union normal form if it is a finite union of union-free expressions. It is well known that every regular expression can be written in union normal form, i.e., all regular languages can be described as finite unions of (nondeterministic) union-free languages. It is also known that the same fact does not hold for deterministic union-free languages, that is, there are regular languages that cannot be written as finite unions of d-union-free languages. As an important result here we show that every regular language can be defined by a finite union of n-union-free languages. This fact also allows to define n-union-complexity of regular languages.

scholarly journals A complete characterization of all-versus-nothing arguments for stabilizer states

2017 ◽  
Vol 375 (2106) ◽  
pp. 20160385 ◽  
Author(s):  
Samson Abramsky ◽  
Rui Soares Barbosa ◽  
Giovanni Carù ◽  
Simon Perdrix
Keyword(s):  
Complete Characterization ◽  
Qubit State ◽  
Computational Method ◽  
Quantum Foundations ◽  
Important Class ◽  
Combinatorial Characterization ◽  
Graph States ◽  
Quantum Revolution ◽  
Stabilizer States

An important class of contextuality arguments in quantum foundations are the all-versus-nothing (AvN) proofs, generalizing a construction originally due to Mermin. We present a general formulation of AvN arguments and a complete characterization of all such arguments that arise from stabilizer states. We show that every AvN argument for an n -qubit stabilizer state can be reduced to an AvN proof for a three-qubit state that is local Clifford-equivalent to the tripartite Greenberger–Horne–Zeilinger state. This is achieved through a combinatorial characterization of AvN arguments, the AvN triple theorem, whose proof makes use of the theory of graph states. This result enables the development of a computational method to generate all the AvN arguments in on n -qubit stabilizer states. We also present new insights into the stabilizer formalism and its connections with logic. This article is part of the themed issue ‘Second quantum revolution: foundational questions’.

SOME REMARKS ON THE HAIRPIN COMPLETION

2010 ◽  
Vol 21 (05) ◽  
pp. 859-872 ◽  
Author(s):  
FLORIN MANEA ◽  
VICTOR MITRANA ◽  
TAKASHI YOKOMORI
Keyword(s):  
Regular Language ◽  
Regular Languages ◽  
Decision Problems ◽  
Strict Sense ◽  
Closure Properties ◽  
New Words ◽  
The Family

We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.

A class of representations of involutive bialgebras

1990 ◽  
Vol 107 (1) ◽  
pp. 149-175 ◽  
Author(s):  
Michael Schürmann
Keyword(s):  
General Result ◽  
Linear Functional ◽  
Fock Space ◽  
Positive Definite ◽  
Complete Characterization ◽  
Lie Superalgebras ◽  
Algebra Structure ◽  
Infinitely Divisible ◽  
Positive Linear Functional

AbstractA class of representations on Fock space is associated to a representation of the *-algebra structure of a cocommutative graded bialgebra with an involution. We prove that the Gelfand–Naimark–Segal (GNS) representation given by the convolution exponential of a conditionally positive linear functional can be embedded into a representation of this class. Our theory generalizes a well-known construction for infinitely divisible positive definite functions on a group. Applying our general result, we obtain a complete characterization of the GNS representations given by infinitely divisible states on involutive Lie superalgebras.

Experimental Characterization of Mechanical Behavior of Cord-Rubber Composites

1982 ◽  
Vol 10 (1) ◽  
pp. 37-54 ◽  
Author(s):  
M. Kumar ◽  
C. W. Bert
Keyword(s):  
Response Characteristic ◽  
Cord Compression ◽  
Complete Characterization ◽  
Strain Response ◽  
Strain Gages ◽  
Experimental Characterization ◽  
Rubber Composites ◽  
Stress Strain ◽  
Strain Data

Abstract Unidirectional cord-rubber specimens in the form of tensile coupons and sandwich beams were used. Using specimens with the cords oriented at 0°, 45°, and 90° to the loading direction and appropriate data reduction, we were able to obtain complete characterization for the in-plane stress-strain response of single-ply, unidirectional cord-rubber composites. All strains were measured by means of liquid mercury strain gages, for which the nonlinear strain response characteristic was obtained by calibration. Stress-strain data were obtained for the cases of both cord tension and cord compression. Materials investigated were aramid-rubber, polyester-rubber, and steel-rubber.

Characterization of CMOS Structures (0.6 µm process) Submitted to HBM and COM ESD Stress Tests

1997 ◽  
Author(s):  
G. Meneghesso ◽  
E. Zanoni ◽  
P. Colombo ◽  
M. Brambilla ◽  
R. Annunziata ◽  
...  
Keyword(s):  
Electron Microscopy ◽  
Electrostatic Discharge ◽  
Stress Test ◽  
Complete Characterization ◽  
Stress Tests ◽  
Test Procedures ◽  
Emission Microscopy ◽  
Fast Rise ◽  
Scanning Electron

Abstract In this work, we present new results concerning electrostatic discharge (ESD) robustness of 0.6 μm CMOS structures. Devices have been tested according to both HBM and socketed CDM (sCDM) ESD test procedures. Test structures have been submitted to a complete characterization consisting in: 1) measurement of the tum-on time of the protection structures submitted to pulses with very fast rise times; 2) ESD stress test with the HBM and sCDM models; 3) failure analysis based on emission microscopy (EMMI) and Scanning Electron Microscopy (SEM).

scholarly journals Complete characterization of spin chains with two Ising symmetries

2019 ◽  
Vol 125 (1) ◽  
pp. 10008 ◽  
Author(s):  
Bat-el Friedman ◽  
Atanu Rajak ◽  
Emanuele G. Dalla Torre
Keyword(s):  
Complete Characterization ◽  
Spin Chains

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals Protein complex formation in methionine chain-elongation and leucine biosynthesis

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Li-Qun Chen ◽  
Shweta Chhajed ◽  
Tong Zhang ◽  
Joseph M. Collins ◽  
Qiuying Pang ◽  
...  
Keyword(s):  
Protein Complexes ◽  
Complete Characterization ◽  
Bimolecular Fluorescence Complementation ◽  
Chain Elongation ◽  
Substrate Channeling ◽  
Leucine Biosynthesis ◽  
Protein Complex Formation ◽  
Genes Encoding ◽  
Isopropylmalate Dehydrogenase

AbstractDuring the past two decades, glucosinolate (GLS) metabolic pathways have been under extensive studies because of the importance of the specialized metabolites in plant defense against herbivores and pathogens. The studies have led to a nearly complete characterization of biosynthetic genes in the reference plant Arabidopsis thaliana. Before methionine incorporation into the core structure of aliphatic GLS, it undergoes chain-elongation through an iterative three-step process recruited from leucine biosynthesis. Although enzymes catalyzing each step of the reaction have been characterized, the regulatory mode is largely unknown. In this study, using three independent approaches, yeast two-hybrid (Y2H), coimmunoprecipitation (Co-IP) and bimolecular fluorescence complementation (BiFC), we uncovered the presence of protein complexes consisting of isopropylmalate isomerase (IPMI) and isopropylmalate dehydrogenase (IPMDH). In addition, simultaneous decreases in both IPMI and IPMDH activities in a leuc:ipmdh1 double mutants resulted in aggregated changes of GLS profiles compared to either leuc or ipmdh1 single mutants. Although the biological importance of the formation of IPMI and IPMDH protein complexes has not been documented in any organisms, these complexes may represent a new regulatory mechanism of substrate channeling in GLS and/or leucine biosynthesis. Since genes encoding the two enzymes are widely distributed in eukaryotic and prokaryotic genomes, such complexes may have universal significance in the regulation of leucine biosynthesis.

Sign in / Sign up

Export Citation Format

Share Document