-
Topological study of functions definable by automaton
The subject of this thesis is the study of the topological complexity of omega-rationals functions : functions of finite words which graph is recognizable by finite... -
Logics for unranked and unordered trees and their use for querying semistruct...
Trees are said to be unordered if the order between successor nodes of a given node is not important. Unranked trees are trees which do not have a priori bound on the... -
Automates infinis, logiques et langages
This thesis contributes to the study of families of fi nitely presented in finite graphs. We investigate their logical properties as well as the languages which are... -
Machines hostiles
Les machines (automates de contrôle des titres de transport par exemple) sont apparemment neutres et impartiales mais sont en fait mues par des intentions précises,... -
On Some Quantitative Aspects of Formal Languages
Formal languages are sequences of symbols in some discrete set called alphabet. They are often specified by formulas in some logic, by rational expressions or else by... -
Automata, enumeration and algorithms
Ces travaux s'inscrivent dans le cadre général de la théorie des automates, de la combinatoire des mots, de la combinatoire énumérative et de l'algorithmique. Ils ont... -
An experiment of generative programming on non-sequential structures: automata
This thesis is a contribution to software engineering applied to automata programming. It started with the simple need of an open automaton manipulation software,... -
Automata on Linear Orderings: Complementation
This thesis treats of rational sets of words indexed by linear orderings and particularly of the problem of the closure under complementation. In a seminal paper of... -
Knowledge compilation for online decision-making : application to the control...
Controlling autonomous systems requires to make decisions depending on current observations and objectives. This involves some tasks that must be executed online--with... -
The value problem in stochastic games
Game theory proved to be very useful in the field of verification of open reactive systems. This is due to the wide variety of games' model that differ in the way... -
Kleene algebra, Rewriting modulo AC and Circuits in Coq.
This thesis describe three formalisations in Coq. The first chapter is devoted to the implementation of an efficient decision procedure for Kleene algebras : as... -
Automata and Constraint Programming for Personnel Scheduling Problems
As soon as a structure is organized, the ability to put the right people at the right time is critical to satisfy the need of a department, a school or a company. We... -
Le programme Mogador en linguistique formelle arabe et ses applications dans ...
The MOGADOR project aims at devolopping a new approach to Arabic Natural Langage Processing, by designing software tools based on an original description of Arabic... -
" La salvezza 'attraverso la macchina' -Religione, regola di vita e disposizi...
Traduction par Fausto Pellechia de " Les 'preuves par la machine' ? Religion, règle de vie et disposition des corps chez Spinoza ", intervention au Colloque international... -
ArchiMed: canevas multi-médiateur pour la réconciliation de conversations ent...
Numéro spécial Modèles, Formalismes et Outils pour les Systèmes d'Information -
Evaluation des systèmes électroniques programmables relatifs à la sécurité de...
Actuellement, les exploitants de process industriels se tournent vers des organismes indépendants pour faire valider les performances de leurs systèmes de gestion des... -
Exigences techniques pour les systèmes dédiés à la sécurité comme définies da...
Actuellement, les fabricants d'automates programmables industriels dédiés à la gestion de fonctions de sécurité, soumettent leur produit à des organismes indépendants... -
D'une sociologie de l'atelier de chimie de spécialité à une sociologie de la ...
This dataset has no description
