513 search results - page 3 / 103 » Finitely Based, Finite Sets of Words |
IMCSIT
2010
13 years 6 months ago
2010
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
APAL
2002
13 years 8 months ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
ITA
2008
13 years 8 months ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...