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 94 Next

Displaying 1861 – 1880 of 4973

Showing per page

Finding H-partitions efficiently

Simone Dantas, Celina M.H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2010)

RAIRO - Theoretical Informatics and Applications

We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H, with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, 4-part, external...

Finite automata and algebraic extensions of function fields

Kiran S. Kedlaya (2006)

Journal de Théorie des Nombres de Bordeaux

We give an automata-theoretic description of the algebraic closure of the rational function field 𝔽 q ( t ) over a finite field 𝔽 q , generalizing a result of Christol. The description occurs within the Hahn-Mal’cev-Neumann field of “generalized power series” over 𝔽 q . In passing, we obtain a characterization of well-ordered sets of rational numbers whose base p expansions are generated by a finite automaton, and exhibit some techniques for computing in the algebraic closure; these include an adaptation to positive...

Finite completion of comma-free codes. Part 1

Nguyen Huong Lam (2004)

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

This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...

Finite Completion of comma-free codes Part 1

Nguyen Huong Lam (2010)

RAIRO - Theoretical Informatics and Applications

This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...

Finite completion of comma-free codes. Part 2

Nguyen Huong Lam (2004)

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

This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.

Currently displaying 1861 – 1880 of 4973