Factorisation des ensembles préfixiels
Factors of generalized Rudin-Shapiro sequences. (Facteurs des suites de Rudin-Shapiro généralisées.)
Fair expressions and regular languages over lists
Fairness and regularity for SCCS processes
Familles de langages
Fermeture de certaines classes de langages formels sous des permutations linguistiques
Finitary codes for biinfinite words
Finite automata and algebraic extensions of function fields
We give an automata-theoretic description of the algebraic closure of the rational function field over a finite field , generalizing a result of Christol. The description occurs within the Hahn-Mal’cev-Neumann field of “generalized power series” over . In passing, we obtain a characterization of well-ordered sets of rational numbers whose base expansions are generated by a finite automaton, and exhibit some techniques for computing in the algebraic closure; these include an adaptation to positive...
Finite automata and arithmetic.
Finite automata with generalized acceptance criteria.
Finite branching automata
Finite categories and regular languages
Finite degrees of ambiguity in pattern languages
Finiteness results on rewriting systems
First-order properties of trees, star-free expressions, and aperiodicity
Fixed point languages of rational transductions.
Fixpoints, games and the difference hierarchy
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 . 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
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 . 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
Carlitz a défini sur une fonction et une série formelle , analogues respectivement à la fonction de Riemann et au réel . Yu a montré, en utilisant les modules de Drinfeld, que est transcendant pour tout non divisible par . Nous donnons ici une preuve «automatique» de la transcendance de pour , en utilisant le théorème de Christol, Kamae, Mendès France et Rauzy.
Fonctions hypergéométriques bornées