Le lambda-calcul du second ordre
Le problème des roulements de quarts pour les entreprises à feu continu
Learning automata for data communication routing problem
Learning deterministic regular grammars from stochastic samples in polynomial time
Learning deterministic regular grammars from stochastic samples in polynomial time
In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language. It is shown that the time needed grows only linearly with the size of the sample set and a measure of the complexity of the task is provided. Experimentally, our implementation proves very fast for application purposes.
Learning discrete categorial grammars from structures
We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word...
Learning extremal regulator implementation by a stochastic automaton and stochastic approximation theory
There exist many different approaches to the investigation of the characteristics of learning system. These approaches use different branches of mathematics and, thus, obtain different results, some of them are too complicated and others do not match the results of practical experiments. This paper presents the modelling of learning systems by means of stochastic automate, mainly one particular model of a learning extremal regulator. The proof of convergence is based on Dvoretzky's Theorem on stochastic...
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability, as introduced by the author in [Theoret. Comput. Sci.290 (2003) 1679–1711], can be generalized from the case of string languages towards tree languages. This provides a large source of identifiable classes of regular tree languages. Each of these classes can be characterized in various ways. Moreover, we present a generic inference algorithm with polynomial update time...
Left-to-right regular languages and two-way restarting automata
It is shown that the class of left-to-right regular languages coincides with the class of languages that are accepted by monotone deterministic RL-automata, in this way establishing a close correspondence between a classical parsing algorithm and a certain restricted type of analysis by reduction.
Les automates circulaires biaisés vérifient la conjecture de Černý
Les automates formels appliqués à l'étude et à la classification des modèles économétriques
Les -types du système
Nous démontrons dans ce papier que les types du système habités uniquement par des -termes (les -types) sont à quantificateur positif. Nous présentons ensuite des conséquenses de ce résultat et quelques exemples.
Les I-types du système
We prove in this paper that the types of system inhabited uniquely by λI-terms (the I-types) have a positive quantifier. We give also consequences of this result and some examples.
Les symétries dans les réseaux de Petri stochastiques (RdPS). Construction du graphe symbolique
Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique
The main purpose of this paper is to give a method for construction of the reduced reachability graph for Stochastic Petri Nets (SPN), the symbolic graph. This construction is achieved by exploiting the structural symetries in the net using the theory of bisimulation of places for detecting isomorphic parts in the net. The symbolic graph, being isomorphic to an agregated Markov chain, may be used to prove qualitative properties as liveness, boundness, ... Moreover, this reduced graph make more...
Les types de données syntaxiques du système
Nous présentons dans ce papier une définition purement syntaxique des types entrées et des types sorties du système . Nous définissons les types de données syntaxiques comme étant des types entrées et sorties. Nous démontrons que les types à quantificateurs positifs sont des types de données syntaxiques et qu’un type entrée est un type sortie. Nous imposons des restrictions sur la règle d’élimination des quantificateurs pour démontrer qu’un type sortie est un type entrée.
Les types de données syntaxiques du système
We give in this paper a purely syntactical definition of input and output types of system . We define the syntactical data types as input and output types. We show that any type with positive quantifiers is a syntactical data type and that an input type is an output type. We give some restrictions on the ∀-elimination rule in order to prove that an output type is an input type.
Level planar embedding in linear time.
Levels in L-systems
Limit behaviour of trajectories involving subgradients of convex functions