Results 1 -
4 of
4
Axel Thue's work on repetitions in words
- Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics
, 1992
"... The purpose of this survey is to present, in contemporary terminology, the fundamental contributions of Axel Thue to the study of combinatorial properties of sequences of symbols, insofar as repetitions are concerned. The present state of the art is also sketched. ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
The purpose of this survey is to present, in contemporary terminology, the fundamental contributions of Axel Thue to the study of combinatorial properties of sequences of symbols, insofar as repetitions are concerned. The present state of the art is also sketched.
Thue Systems for Pattern Recognition
, 2003
"... This report presents a synoptic overview of Thue Systems. Thue Systems were introduced in the early 1900s by the Norwegian mathematician and logician Axel Thue. In this report the author suggests ways in which such systems can be used in pattern recognition. ..."
Abstract
- Add to MetaCart
This report presents a synoptic overview of Thue Systems. Thue Systems were introduced in the early 1900s by the Norwegian mathematician and logician Axel Thue. In this report the author suggests ways in which such systems can be used in pattern recognition.
HIGHER-DIMENSIONAL NORMALISATION STRATEGIES FOR ACYCLICITY
"... Abstract – We introduce acyclic track polygraphs, a notion of complete categorical cellular models for small categories: they are polygraphs containing generators, with additional invertible cells for relations and higher-dimensional globular syzygies. We give a rewriting method to realise such a mo ..."
Abstract
- Add to MetaCart
Abstract – We introduce acyclic track polygraphs, a notion of complete categorical cellular models for small categories: they are polygraphs containing generators, with additional invertible cells for relations and higher-dimensional globular syzygies. We give a rewriting method to realise such a model by proving that a convergent presentation canonically extends to an acyclic track polygraph. For that, we introduce normalising strategies, defined as homotopically coherent ways to relate each cell of a track polygraph to its normal form, and we prove that acyclicity is equivalent to the existence of a normalisation strategy. Using track polygraphs, we extend to every dimension the homotopical finiteness condition of finite derivation type, introduced by Squier in string rewriting theory, and we prove that it implies a new homological finiteness condition that we introduce here. The proof is based on normalisation strategies and relates acyclic track polygraphs to free abelian resolutions of the small categories they present.

