Morphic word

Known as: Morphic, Prolongable morphism, D0L system 
In mathematics and computer science, a morphic word or substitutive word is an infinite sequence of symbols which is constructed from a particular… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutation… (More)
  • figure 1
Is this relevant?
2013
2013
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of… (More)
Is this relevant?
2010
2010
Let (X, g) be a globally hyperbolic spacetime with Cauchy surface diffeomorphic to an open subset of R. The Legendrian Low… (More)
  • figure 1
Is this relevant?
2009
2009
A pure morphic sequence is a right-infinite, symbolic sequence obtained by iterating a letter-to-word substitution. For instance… (More)
Is this relevant?
2009
2009
Dependency Structure Matrix (DSM) has been successfully applied to identify software dependencies among packages and subsystems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2006
2006
Motivated by the research on pattern languages, we study a fundamental combinatorial question on morphisms in free semigroups… (More)
Is this relevant?
2002
2002
We present new examples of infinite words which have a decidable monadic theory. Formally, we consider structures 〈N, <, P〉 which… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Morphic is a user interface construction environment that strives to embody directness and liveness. Directness means a user… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
This Note deals with binary Sturmian words that are morphic, i.e. generaled by iterating a morphism. Among these, characteristic… (More)
Is this relevant?
1983
1983
It is noted, by using ideas of Culik, Fich and Salomaa [3], that for each language L and each regular language R the language L… (More)
Is this relevant?