# Morphic word

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- WORDS
- 2015

An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutationâ€¦Â (More)

Is this relevant?

2013

2013

- Int. J. Found. Comput. Sci.
- 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

- 2010

Let (X, g) be a globally hyperbolic spacetime with Cauchy surface diffeomorphic to an open subset of R. The Legendrian Lowâ€¦Â (More)

Is this relevant?

2009

2009

- Int. J. Found. Comput. Sci.
- 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

- 16th Working Conference on Reverse Engineering
- 2009

Dependency Structure Matrix (DSM) has been successfully applied to identify software dependencies among packages and subsystemsâ€¦Â (More)

Is this relevant?

2006

2006

- Int. J. Found. Comput. Sci.
- 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

- Inf. Comput.
- 2002

We present new examples of infinite words which have a decidable monadic theory. Formally, we consider structures ã€ˆN, <, Pã€‰ whichâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- ACM Symposium on User Interface Software andâ€¦
- 1995

Morphic is a user interface construction environment that strives to embody directness and liveness. Directness means a userâ€¦Â (More)

Is this relevant?

1994

1994

- ITA
- 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

- Discrete Applied Mathematics
- 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?