5 search results - page 1 / 1 » On a Generalization of Standard Episturmian Morphisms |
DLT
2008
13 years 6 months ago
2008
Abstract. In a recent paper with L. Q. Zamboni the authors introduced the class of -episturmian words, where is an involutory antimorphism of the free monoid A . In this paper, we...
TCS
2008
13 years 5 months ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
TCS
2008
13 years 5 months ago
2008
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
ILP
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
IWFM
1998
13 years 6 months ago
1998
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...