513 search results - page 9 / 103 » Finitely Based, Finite Sets of Words |
JUCS
2002
13 years 8 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
WIA
2001
Springer
14 years 26 days ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
MOC
2000
13 years 8 months ago
2000
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
DLT
2004
13 years 9 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...