Search results for "Formal language"
showing 10 items of 357 documents
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
A description based on languages of the final non-deterministic automaton
2014
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
Ontology Views for Ontology Change Management
2014
International audience; In the literature, ontology change management systems (OCMS) are direct implementation of the concept of “change management” stated by reference (Klein, 2004). Ontology change management combines ontol- ogy evolution and versioning features to manage ontol- ogy changes and their impacts. Since 2007, many works have combined ontology evolution and versioning into ontology change management systems (OCMS). The evolution subject has been massively studied in these works. They especially addressed the consistence issue for the application of changes on the ontology. These proposals constituted a consequent background for ontology change management but they did not take i…
Modeling Changes for SHOIN(D) Ontologies: An Exhaustive Structural Model
2013
Ontology development starts with a rigorous ontological analysis that provides a conceptualization of the domain to model agreed by the community. An ontology, specified in a formal language, approximates the intended models of this conceptualization. It needs then to be revised and refined until an ontological commitment is found. Also ulterior updates, responding to changes in the domain and/or the conceptualization, are expected to occur throughout the ontology life cycle. To handle a consistent application of changes, a couple of ontology evolution methodologies have been proposed. Maintaining the structural consistency is one of the ontology evolution criteria. It implies modeling chan…
"Table 5" of "Measurement of exclusive $\gamma\gamma\rightarrow \ell^+\ell^-$ production in proton-proton collisions at $\sqrt{s} = 7$ TeV with the A…
2015
Acoplanarity (ACO) distributions unfolded for detector resolution, and lepton pair trigger, reconstruction and identification efficiencies for e+ e- channel (empty bins are not reported).
The complexity of graph languages generated by hyperedge replacement
1990
Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-free Chomsky grammars are in the realm of string rewriting, their parsing problem is known to be, in general, NP-complete. In this paper, the main difficulty in HRG parsing is analysed and some conditions on either grammar or input graphs are developed under which parsing can be done in polynomial time. For some of the cases, the parsing problem is shown to be log-space reducible to context-free string parsing.
Patterns in words and languages
2004
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-erasing morphism h from E∗ to A∗ such that h(p)=w. If we take E=A, given two words u,v∈A∗, we write u⩽v if u is a pattern of v. The restriction of ⩽ to aA∗, where A is the binary alphabet {a,b}, is a partial order relation. We introduce, given a word v, the set P(v) of all words u such that u⩽v. P(v), with the relation ⩽, is a poset and it is called the pattern poset of v. The first part of the paper is devoted to investigate the relationships between the structure of the poset P(v) and the combinatorial properties of the word v. In the last section, for a given language L, we consider …
The forgotten mathematical legacy of Peano
2019
International audience; The formulations that Peano gave to many mathematical notions at the end of the 19th century were so perfect and modern that they have become standard today. A formal language of logic that he created, enabled him to perceive mathematics with great precision and depth. He described mathematics axiomatically basing the reasoning exclusively on logical and set-theoretical primitive terms and properties, which was revolutionary at that time. Yet, numerous Peano’s contributions remain either unremembered or underestimated.
Logics and operators
2003
Two connectives are of special interest in metalogical investigations — the connective of implication which is important due to its connections to the notion of inference, and the connective of equivalence. The latter connective expresses, in the material sense, the fact that two sentences have the same logical value while in the strict sense it expresses the fact that two sentences are interderivable on the basis of a given logic. The process of identification of equivalent sentences relative to theories of a logic C defines a class of abstract algebras. The members of the class are called Lindenbaum-Tarski algebras of the logic C. One may abstract from the origin of these algebras and exa…