Search results for "formal languages"

showing 10 items of 322 documents

Connecting Granular and Topological Relations through Description Logics

2021

Granularity deals with organizing in greater or lesser detail data, information, and knowledge that resides at a granular level. This organization is carried out according to certain criteria, which thereby provide a context view or dimension also called granular perspective. Topological relations express spatial associations among geospatial features (points, polylines, and polygons); they represent a horizontal spatial analysis. The two domains allow scientists to conceive different perspectives of the world. In this article, we aim to combine the two representations through Description Logics (DL) rules to relate granular (vertical representation) and geospatial topological (horizontal r…

GeoSPARQL[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Topological RelationsGranular RelationsGranular ComputingDescription LogicGeospatial Data[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL][MATH.MATH-GN] Mathematics [math]/General Topology [math.GN]
researchProduct

Motzkin subposets and Motzkin geodesics in Tamari lattices

2014

The Tamari lattice of order n can be defined by the set D n of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin words in this structure. This distance can also be interpreted as the length of a geodesic between these Motzkin words in a Tamari lattice. So, a new upper bound is obtained for the classical rotation distance between two Motzkin words in a Tamari lattice. For some specific pairs of Motzkin words, this b…

GeodesicSemilattice0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatorics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsMathematics::Combinatorics010102 general mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Join (topology)Computer Science ApplicationsJoin and meet010201 computation theory & mathematicsSignal ProcessingMotzkin numberTamari latticeRotation (mathematics)Computer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

SOMATISKIE FRAZEOLOĢISMI K. ULMAŅA LATVIEŠU-VĀCU VĀRDNĪCĀ (1872) UN K. ULMAŅA / G. BRAŽES VĀCU-LATVIEŠU VĀRDNĪCĀ (1880)

2021

The paper analyses Latvian and German somatic idioms in the dictionaries by K. Ulmann and K. Ulmann / G. Braže. Up to now the researchers of Latvian phraseology have not focused to analyse these theme – especially in diachronic aspect. The paper presents the most fixed somatic idioms in the Latvian and German and their equivalence types. The author compares with the meanings of idioms from the first dictionary (1638) to modern electronic dictionary “Modern Latvian dictionary”. KEY WORDS: the dictionaries by K. Ulmann and K. Ulmann / G. Braže, somatic idioms, somatic components, the equivalence types of German–Latvian somatic idioms. DOI: http://dx.doi.org/10.15181/rh.v19i0.1329

GermanEngineeringElectronic dictionarybusiness.industryPhraseologylanguageLatvianGeneral MedicineEquivalence (formal languages)businesslanguage.human_languageLinguisticsRes Humanitariae
researchProduct

Languages associated with saturated formations of groups

2013

International audience; In a previous paper, the authors have shown that Eilenberg's variety theorem can be extended to more general structures, called formations. In this paper, we give a general method to describe the languages corresponding to saturated formations of groups, which are widely studied in group theory. We recover in this way a number of known results about the languages corresponding to the classes of nilpotent groups, soluble groups and supersoluble groups. Our method also applies to new examples, like the class of groups having a Sylow tower.; Dans un article précédent, les auteurs avaient montré comment étendre le théorème des variétés d'Eilenberg à des structures plus g…

Group formationGeneral MathematicsFinite monoid[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]0102 computer and information sciences01 natural sciencesregular languageRegular languageÁlgebra0101 mathematicsValenciaMathematicsFinite groupbiologyApplied Mathematics010102 general mathematicsACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesRegular languagebiology.organism_classificationAlgebra010201 computation theory & mathematicsMSC 68Q70 20D10 20F17 20M25finite groupsaturated formationformationsFinite automata
researchProduct

On Sets of Words of Rank Two

2019

Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that X⊆ F∗. A submonoid M generated by k elements of A∗ is k-maximal if there does not exist another submonoid generated by at most k words containing M. We call a set X⊆ A∗ primitive if it is the basis of a |X|-maximal submonoid. This extends the notion of primitive word: indeed, w is a primitive set if and only if w is a primitive word. By definition, for any set X, there exists a primitive set Y such that X⊆ Y∗. The set Y is therefore called a primitive root of X. As a main result, we prove that if a set has rank 2, then it has a unique primitive …

Hidden repetitionPrimitive setExistential quantificationBinary rootk-maximal monoidPseudo-repetitionBasis (universal algebra)CombinatoricsSet (abstract data type)RepetitionCardinalityFree monoidRank (graph theory)Primitive root modulo nComputer Science::Formal Languages and Automata TheoryWord (group theory)Mathematics
researchProduct

General invertible transformation and physical degrees of freedom

2017

An invertible field transformation is such that the old field variables correspond one-to-one to the new variables. As such, one may think that two systems that are related by an invertible transformation are physically equivalent. However, if the transformation depends on field derivatives, the equivalence between the two systems is nontrivial due to the appearance of higher derivative terms in the equations of motion. To address this problem, we prove the following theorem on the relation between an invertible transformation and Euler-Lagrange equations: If the field transformation is invertible, then any solution of the original set of Euler-Lagrange equations is mapped to a solution of …

High Energy Physics - TheoryPhysicsPure mathematicsCosmology and Nongalactic Astrophysics (astro-ph.CO)010308 nuclear & particles physicsEquations of motionMaterial derivativeClassical Physics (physics.class-ph)FOS: Physical sciencesPhysics - Classical PhysicsGeneral Relativity and Quantum Cosmology (gr-qc)01 natural sciencesGeneral Relativity and Quantum CosmologyTensor fieldlaw.inventionField transformationInvertible matrixHigh Energy Physics - Theory (hep-th)law0103 physical sciencesEquivalence (formal languages)010306 general physicsField equationScalar fieldAstrophysics - Cosmology and Nongalactic Astrophysics
researchProduct

"Table 54" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the 2LSR2 region in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.

InclusiveDijet ProductionProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 52" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the 2LSR1 region in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.

InclusiveDijet ProductionProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 62" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the 2LSR1 region in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.

InclusiveDijet ProductionProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 64" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the 2LSR2 region in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.

InclusiveDijet ProductionProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct