Search results for "languages"

showing 10 items of 2101 documents

Local Spectral Theory for R and S Satisfying RnSRn = Rj

2020

In this paper, we analyze local spectral properties of operators R,S and RS which satisfy the operator equations RnSRn=Rj and SnRSn=Sj for same integers j&ge

Pure mathematicsAlgebra and Number TheorySpectral theoryDunford’s property (C) and property (β)Local spectral subspacesLogiclcsh:Mathematics010102 general mathematicsSpectral propertieslcsh:QA1-93901 natural sciences010101 applied mathematicsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESOperator (computer programming)Transmission (telecommunications)Settore MAT/05 - Analisi MatematicaDunford’s property (<i>C</i>) and property (<i>β</i>)Data_FILESDrazin invertible operatorsGeometry and Topology0101 mathematicsMathematical PhysicsAnalysisMathematicsAxioms
researchProduct

Formations of finite monoids and formal languages: Eilenberg’s variety theorem revisited

2014

International audience; We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to formal languages. We prove that there is a bijective correspondence between formations of finite monoids and certain classes of languages, the formations of languages. Our result permits to treat classes of finite monoids which are not necessarily closed under taking submonoids, contrary to the original theory. We also prove a similar result for ordered monoids.; Nous présentons une extension du théorème des variétés d'Eilenberg, un résultat célèbre reliant l'algèbre à la théorie des langages formels. Nous montrons qu'il existe une correspondance bijective entre les form…

Pure mathematicsApplied MathematicsGeneral MathematicsACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Abstract family of languagesFormationRegular languagesCone (formal languages)regular languagePumping lemma for regular languagesAlgebravarietyRegular languageÁlgebraMSC 68Q70 20D10 20F17 20M25Mathematics::Category TheoryFormal languageVariety (universal algebra)SemigroupsGroup formationsAutomata theoryMathematics
researchProduct

Strong Converse Results for Linking Operators and Convex Functions

2020

We consider a family B n , ρ c of operators which is a link between classical Baskakov operators (for ρ = ∞ ) and their genuine Durrmeyer type modification (for ρ = 1 ). First, we prove that for fixed n , c and a fixed convex function f , B n , ρ c f is decreasing with respect to ρ . We give two proofs, using various probabilistic considerations. Then, we combine this property with some existing direct and strong converse results for classical operators, in order to get such results for the operators B n , ρ c applied to convex functions.

Pure mathematicsArticle Subject010102 general mathematicsMathematicsofComputing_GENERALProbabilistic logicType (model theory)Mathematical proof01 natural sciences010104 statistics & probabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESBaskakov operatorConverseQA1-939Order (group theory)0101 mathematicsConvex functionLink (knot theory)AnalysisMathematicsMathematicsJournal of Function Spaces
researchProduct

Local Gromov-Witten invariants are log invariants

2019

We prove a simple equivalence between the virtual count of rational curves in the total space of an anti-nef line bundle and the virtual count of rational curves maximally tangent to a smooth section of the dual line bundle. We conjecture a generalization to direct sums of line bundles.

Pure mathematicsConjectureGeneral Mathematics010102 general mathematicsTangent01 natural sciencesMathematics - Algebraic GeometryMathematics::Algebraic Geometry14N35 14D06 53D45Line bundle0103 physical sciencesFOS: Mathematics010307 mathematical physics0101 mathematicsEquivalence (formal languages)QAAlgebraic Geometry (math.AG)Mathematics::Symplectic GeometryMathematics
researchProduct

Two-way automata with multiplicity

2005

We introduce the notion of two-way automata with multiplicity in a semiring. Our main result is the extension of Rabin, Scott and Shepherdson's Theorem to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using special two-way automata.

Pure mathematicsFinite-state machineRegular languageLocal configurationCommutative semiringMultiplicity (mathematics)Computer Science::Formal Languages and Automata TheorySemiringAutomatonMathematics
researchProduct

Formations of Monoids, Congruences, and Formal Languages

2015

The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the existence of a bijective correspondence between three concepts; formations of monoids, formations of languages and formations of congruences. The result does not require finiteness on monoids, nor regularity on languages nor finite index conditions on congruences. We relate our work to other results in the field and we include applications to non-r-disjunctive languages, Reiterman s equational description of pseudovarieties and varieties of monoids.

Pure mathematicsGeneral Computer ScienceApplied MathematicsData ScienceCWI Technical Report reportFormationsLlenguatges de programacióAbstract family of languagesCongruence relationlcsh:QA75.5-76.95Formal languagesMathematics::Category TheoryFormal languageComputingMethodologies_DOCUMENTANDTEXTPROCESSINGBijectionAutomata theorylcsh:Electronic computers. Computer scienceÀlgebraEquivalence (formal languages)SemigroupsMATEMATICA APLICADAAlgorithmAutomata theoryMathematicsScientific Annals of Computer Science
researchProduct

A characterization of regular circular languages generated by marked splicing systems

2009

AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…

Pure mathematicsGeneral Computer ScienceMolecular computing Splicing systems Circular words Formal languages Automata theoryMolecular computingQuantitative Biology::GenomicsDecidabilityTheoretical Computer ScienceSet (abstract data type)Formal languagesRegular languageFormal languageRNA splicingAutomata theorySplicing systemsCircular wordsFinite setAlgorithmWord (computer architecture)Automata theoryMathematicsComputer Science(all)
researchProduct

Representation Theorems for Indefinite Quadratic Forms Revisited

2010

The first and second representation theorems for sign-indefinite, not necessarily semi-bounded quadratic forms are revisited. New straightforward proofs of these theorems are given. A number of necessary and sufficient conditions ensuring the second representation theorem to hold is proved. A new simple and explicit example of a self-adjoint operator for which the second representation theorem does not hold is also provided.

Pure mathematicsGeneral MathematicsFOS: Physical sciencesMathematical proofDirac operator01 natural sciencesMathematics - Spectral Theorysymbols.namesakeOperator (computer programming)Simple (abstract algebra)0103 physical sciencesFOS: Mathematics0101 mathematicsSpectral Theory (math.SP)Mathematical PhysicsMathematicsRepresentation theorem010102 general mathematicsRepresentation (systemics)Mathematical Physics (math-ph)16. Peace & justice47A07 47A55 15A63 46C20Functional Analysis (math.FA)Mathematics - Functional AnalysisTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsIndefinite quadratic forms ; representation theorems ; perturbation theory ; Krein spaces ; Dirac operator010307 mathematical physicsPerturbation theory (quantum mechanics)
researchProduct

Harnack and Shmul'yan pre-order relations for Hilbert space contractions

2015

We study the behavior of some classes of Hilbert space contractions with respect to Harnack and Shmul'yan pre-orders and the corresponding equivalence relations. We give some conditions under which the Harnack equivalence of two given contractions is equivalent to their Shmul'yan equivalence and to the existence of an arc joining the two contractions in the class of operator-valued contractive analytic functions on the unit disc. We apply some of these results to quasi-isometries and quasi-normal contractions, as well as to partial isometries for which we show that their Harnack and Shmul'yan parts coincide. We also discuss an extension, recently considered by S.~ter~Horst [\emph{J. Operato…

Pure mathematicsGeneral Mathematics[MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA]01 natural sciencesasymptotic limitpartial isometriessymbols.namesakeFOS: MathematicsEquivalence relation0101 mathematicsEquivalence (formal languages)Toeplitz operatorsMathematicsPartial isometry010102 general mathematicsClass functionHilbert spacequasi normal operators16. Peace & justiceHarnack pre-orderFunctional Analysis (math.FA)010101 applied mathematicsMathematics - Functional Analysis47A10 47A45Hilbert space contractionssymbolsShmul'yan pre-orderAnalytic function
researchProduct

Congruence-based proofs of the recognizability theorems for free many-sorted algebras

2020

Abstract We generalize several recognizability theorems for free single-sorted algebras to free many-sorted algebras and provide, in a uniform way and without using either regular tree grammars or tree automata, purely algebraic proofs of them based on congruences.

Pure mathematicsLogicComputer science010102 general mathematics0102 computer and information sciencesMathematical proof01 natural sciencesTheoretical Computer ScienceArts and Humanities (miscellaneous)010201 computation theory & mathematicsHardware and ArchitectureCongruence (manifolds)0101 mathematicsComputer Science::Formal Languages and Automata TheorySoftwareJournal of Logic and Computation
researchProduct