On block irreducible forms over Euclidean domains.
Clark, W.Edwin, Liang, J.J. (1980)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Clark, W.Edwin, Liang, J.J. (1980)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Priestley, H.A., Santos, R. (1998)
Portugaliae Mathematica
Similarity:
Jaroslav Ježek, P. Marković, M. Maróti, R. McKenzie (1999)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Julien Bernat (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
Let be a language. A balanced pair consists of two words and in which have the same number of occurrences of each letter. It is irreducible if the pairs of strict prefixes of and of the same length do not form balanced pairs. In this article, we are interested in computing the set of irreducible balanced pairs on several cases of languages. We make connections with the balanced pairs algorithm and discrete geometrical constructions related to substitutive languages. We characterize...
W. Bloki, I. Ferreirim (1993)
Banach Center Publications
Similarity:
Ramalho, Margarita, Sequeira, Margarida (1987)
Portugaliae mathematica
Similarity:
Václav Koubek (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity: