All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 78

Showing per page

Fixpoints, games and the difference hierarchy

Julian C. Bradfield (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Drawing on an analogy with temporal fixpoint logic, we relate the arithmetic fixpoint definable sets to the winning positions of certain games, namely games whose winning conditions lie in the difference hierarchy over Σ 2 0 . This both provides a simple characterization of the fixpoint hierarchy, and refines existing results on the power of the game quantifier in descriptive set theory. We raise the problem of transfinite fixpoint hierarchies.

Fixpoints, games and the difference hierarchy

Julian C. Bradfield (2010)

RAIRO - Theoretical Informatics and Applications

Drawing on an analogy with temporal fixpoint logic, we relate the arithmetic fixpoint definable sets to the winning positions of certain games, namely games whose winning conditions lie in the difference hierarchy over Σ 2 0 . This both provides a simple characterization of the fixpoint hierarchy, and refines existing results on the power of the game quantifier in descriptive set theory. We raise the problem of transfinite fixpoint hierarchies.

Fonction ζ de Carlitz et automates

Valérie Berthé (1993)

Journal de théorie des nombres de Bordeaux

Carlitz a défini sur 𝔽 q une fonction ζ et une série formelle I I , analogues respectivement à la fonction ζ de Riemann et au réel π . Yu a montré, en utilisant les modules de Drinfeld, que ζ ( s ) / I I 3 est transcendant pour tout s non divisible par q - 1 . Nous donnons ici une preuve «automatique» de la transcendance de ζ ( s ) / I I 3 pour 1 ≤ s ≤ q - 2 , en utilisant le théorème de Christol, Kamae, Mendès France et Rauzy.

Forbidden factors and fragment assembly

F. Mignosi, A. Restivo, M. Sciortino (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments) of a word w . We introduce an hypothesis involving the set of fragments I and the maximal length m ( w ) of the minimal forbidden factors of w . Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear...

Forbidden Factors and Fragment Assembly

F. Mignosi, A. Restivo, M. Sciortino (2010)

RAIRO - Theoretical Informatics and Applications

In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments) of a word w. We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal forbidden factors of w. Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear...

Foreword

V. Bruyère, M. Rigo (2010)

RAIRO - Theoretical Informatics and Applications

Formal language properties of hybrid systems with strong resets

Thomas Brihaye, Véronique Bruyère, Elaine Render (2010)

RAIRO - Theoretical Informatics and Applications

We study hybrid systems with strong resets from the perspective of formal language theory. We define a notion of hybrid regular expression and prove a Kleene-like theorem for hybrid systems. We also prove the closure of these systems under determinisation and complementation. Finally, we prove that the reachability problem is undecidable for synchronized products of hybrid systems.

Formal Methods to Improve Public Administration Business Processes

Andrea Polini, Andrea Polzonetti, Barbara Re (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Starting from late 90’s the public administration has started to employ a quite relevant amount of its budget in developing ICT solutions to better deliver services to citizens. In spite of this effort many statistics show that the mere availability of ICT based services does not guarantee per se their usage. Citizens have continued to largely access services through “traditional” means. In our study we suggest that the highlighted situation is partly due to the fact that relevant domain dependent...

Formal Methods to Improve Public Administration Business Processes

Andrea Polini, Andrea Polzonetti, Barbara Re (2012)

RAIRO - Theoretical Informatics and Applications

Starting from late 90’s the public administration has started to employ a quite relevant amount of its budget in developing ICT solutions to better deliver services to citizens. In spite of this effort many statistics show that the mere availability of ICT based services does not guarantee per se their usage. Citizens have continued to largely access services through “traditional” means. In our study we suggest that the highlighted situation is partly...

Formally certified floating-point filters for homogeneous geometric predicates

Guillaume Melquiond, Sylvain Pion (2007)

RAIRO - Theoretical Informatics and Applications

Floating-point arithmetic provides a fast but inexact way of computing geometric predicates. In order for these predicates to be exact, it is important to rule out all the numerical situations where floating-point computations could lead to wrong results. Taking into account all the potential problems is a tedious work to do by hand. We study in this paper a floating-point implementation of a filter for the orientation-2 predicate, and how a formal and partially automatized verification of this...

Formulation of Cell Petri Nets

Mitsuru Jitsukawa, Pauline N. Kawamoto, Yasunari Shidama (2013)

Formalized Mathematics

Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i further. The synthesis of two Petri nets was introduced in [11] and in this work the definition is extended...

Currently displaying 41 – 60 of 78