• Aucun résultat trouvé

Formal languages

Critical Behavior in Physics and Probabilistic Formal Languages

Critical Behavior in Physics and Probabilistic Formal Languages

... about formal languages is closely related to a well-known result in classical statistical mechanics that there are no phase transitions in dimensions fewer than ...

26

Bridging the Gap Between Formal Languages and Natural Languages with Zippers

Bridging the Gap Between Formal Languages and Natural Languages with Zippers

... of formal languages to represent and reason on facts (RDF), logical axioms (OWL), or queries ...between formal lan- guages (FL) designed for the machines, and natural languages (NL) understood ...

16

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

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

... This paper is the first step of a programme aiming at exploring the connections between the formations of finite groups and regular languages. The starting point is Eilenberg’s variety theorem [10], a celebrated ...

25

Difference hierarchies and duality with an application to formal languages

Difference hierarchies and duality with an application to formal languages

... Difference hierarchies and duality with an application to formal languages I C´ elia Borlido a,∗ , Mai Gehrke a , Andreas Krebs b , Howard Straubing c a Laboratoire J. A. Dieudonn´ e, CNRS, Universit´ e Cˆ ...

42

Flexible RNA design under structure and sequence constraints using formal languages

Flexible RNA design under structure and sequence constraints using formal languages

... 2.4 Combining structural and sequential con- straints It is well-known that context-free languages are not closed under intersection. However, the intersection of a context- free language with a regular language ...

11

Equational descriptions of languages

Equational descriptions of languages

... for formal languages, ranging over a period of 45 years: from Sch¨ utzenberger’s characterization of star-free languages [36] to the following recent result of [18]: Every lattice of languages ...

15

Formal verification of a memory model for C-like imperative languages

Formal verification of a memory model for C-like imperative languages

... Introduction Formal verication of computer programs  be it by model checking, program proof, static analysis, or any other means  obviously requires that the semantics of the programming language in which the ...

22

A Common Aspect Languages Interpreter

A Common Aspect Languages Interpreter

... programming languages and techniques such as OOP and design patterns do not elegantly modularize ...Programming Languages (AOPLs) were proposed in order to make it possible to express crosscutting ...

230

Experiments in discriminating similar languages

Experiments in discriminating similar languages

... 5 Conclusions We described the National Research Council’s entry to the second shared task on Discriminat- ing between similar languages . Our system uses a fairly straightforward processing and modeling approach, ...

8

Acceptance Conditions for ω-Languages

Acceptance Conditions for ω-Languages

... of languages (see the diamond in the left part of Figure 2), all other acceptance conditions considered tend to give (classes of) languages populating known ...

13

Expressive power of query languages

Expressive power of query languages

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

36

Polyhedral Analysis for Synchronous Languages

Polyhedral Analysis for Synchronous Languages

... 1 Introduction Synchronous languages [11] such as Signal [2], Lustre [6] and Esterel [4] have been designed to facilitate the development of reactive systems. They enable a high-level speci cation and a modular ...

19

On Backdoors To Tractable Constraint Languages

On Backdoors To Tractable Constraint Languages

... If we denote by FGBW the set of all pairs of operations (f, g) on N satisfying these three conditions, the class T BW is composite and idempotent since it can be written as T BW = ∪ (f,g)∈FGBW (T f ∩ T g ). The choice ...

17

Formal Cellular Machinery

Formal Cellular Machinery

... Keywords: systems biology, compartment, rule-based modeling, kappa, bigraphs, projectivity, membrane, term rewriting 1 Introduction It has been about 10 years now since part of the theoretical computer sci- ence ...

35

Desperately Seeking Formal

Desperately Seeking Formal

... que ce procédé peut être poursuivi (c’est-à-dire, en l’occurrence, appliqué à d’autres éléments que les « termes ») dans un sens qui va, précisément, vers une plus grande f[r] ...

22

Formal monkey linguistics

Formal monkey linguistics

... monkey languages share non-trivial properties with human ...monkey languages, and which (ii) conveys information that has greater utility when it is more ...monkey languages will eventually provide ...

59

Verifiable Semantic Difference Languages

Verifiable Semantic Difference Languages

... This paper introduces a general language-agnostic framework in which the semantics of difference languages can be defined and on which mechanically-checked reasoning can be performed. In this framework, ...

13

Regular languages and partial commutations

Regular languages and partial commutations

... The class W is the unique maximal positive variety of languages which does not contain the language (ab) ∗ , for all letters a 6= b. It is also the unique maximal positive variety satisfying the two following ...

33

PARAMETRIC POLYMORPHISM FOR XML PROCESSING LANGUAGES

PARAMETRIC POLYMORPHISM FOR XML PROCESSING LANGUAGES

... 70 CHAPTER 4. FORMAL DEVELOPMENT the decomposition rules (see Lemmas 4.3.9 and 4.3.10), the algorithm decomposes t into several types which are the candidate types to be checked on the next iteration. Since t is ...

291

Formal language for GeoSpelling

Formal language for GeoSpelling

... is an open access repository that collects the work of Arts et Métiers Institute of Technology researchers and makes it freely available over the web where possible.. This is an author-d[r] ...

36

Show all 806 documents...

Sujets connexes