Journal ArticleDOI
Permutation properties and the fibonacci semigroup
Reads0
Chats0
About:
This article is published in Semigroup Forum.The article was published on 1989-12-01. It has received 11 citations till now. The article focuses on the topics: Fibonacci number & Cyclic permutation.read more
Citations
More filters
BookDOI
Finiteness and Regularity in Semigroups and Formal Languages
TL;DR: For the first time in book form, original results from the last ten years are presented, some previously unpublished, using combinatorial and algebraic methods, mainly based on combinatorics on words and especially on the theory of "unavoidable regularities".
Journal ArticleDOI
A characterization of the quadratic irrationals
TL;DR: In this article, it was shown that a positive irrational real number has sub-substitution property if and only if α is the root of a quadratic equation over the rationals.
Book ChapterDOI
Regularity and finiteness conditions
Aldo de Luca,Stefano Varricchio +1 more
TL;DR: The aim of this chapter is to present some recent research work in the combinatorial aspects of the theory of semigroups which are of great interest both for Algebra and Theoretical Computer Science.
Book ChapterDOI
Some combinatorial properties of factorial languages
A. De Luca,Stefano Varricchio +1 more
TL;DR: A factorial language is defined as a language over a finite alphabet in which any word of a word can be prolonged in at least one direction in the language as discussed by the authors, provided that each word of the word can still belong to the language.
Book ChapterDOI
Properties of Infinite Words: Recent Result
TL;DR: In this survey, two problems are considered: to determine conditions on an infinite word such that the set of (finite) words which are not prefixes is context-free and to describe how the number of factors of length n in an infiniteword grows as a function of n.
References
More filters
Book
Combinatorics on words
TL;DR: Perrin and Perrin this article showed that square free words and idempotent semigroups can be expressed in terms of free monoids, and the critical factorization theorem of Van der Waerden's theorem.
Journal ArticleDOI
On cube-free ω-words generated by binary morphisms
TL;DR: It is proved that it is decidable whether a given morphism of the above form generates a cube-free ω-word and it is shown that no more than 10 steps of iterations are needed to solve the problem.
Journal ArticleDOI
On the burnside problem for semigroups
Related Papers (5)
Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
A. De Luca,Stefano Varricchio +1 more