Trajectory-based embedding relations
Fundamenta Informaticae
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Algebraic properties of substitution on trajectories
Theoretical Computer Science
On codes defined by bio-operations
Theoretical Computer Science
On codes defined by bio-operations
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Trajectory-Based Embedding Relations
Fundamenta Informaticae
| Hi-index | 0.00 |
The notion of shuffle on trajectories is a natural generalization of many word operations considered in the literature. For a set of trajectories T, we define the notion of a T-code and examine its properties. Particular instances of T-codes are prefix-, suffix-, infix-, outfix- and hyper-codes, as well as other classes studied in the literature.