Finding dominators in practice.
Finding -partitions efficiently
We study the concept of an -partition of the vertex set of a graph , 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 , 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, -part,...
Finding H-partitions efficiently
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...
Finding induced acyclic subgraphs in random digraphs.
Finding Minimum Area k-gons.
Finding nonoverlapping substructures of a sparse matrix.
Finding shortest paths with computational geometry.
Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
Finely homogeneous computations in free Lie algebras.
Fingerprint identification based on dermatological features.
Finitary codes for biinfinite words
Finite alogorithmic procedures and computation theories.
Finite alogorithmic procedures and inductive definability.
Finite and infinite computations of logic programs
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 completion of comma-free codes. Part 1
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...