Results 191 to 200 of about 377,277 (219)
Some of the next articles are maybe not open access.
2004
The word substitutions are binary word operations which can be basically interpreted as a deletion followed by insertion, with some restrictions applied. Besides being itself an interesting topic in formal language theory, they have been naturally applied to modelling noisy channels.
Lila Kari +2 more
openaire +1 more source
The word substitutions are binary word operations which can be basically interpreted as a deletion followed by insertion, with some restrictions applied. Besides being itself an interesting topic in formal language theory, they have been naturally applied to modelling noisy channels.
Lila Kari +2 more
openaire +1 more source
Bull. EATCS, 1998
Summary: Shuffle on trajectories is a useful tool to study a variety of problems in the area of parallel composition of words, processes, automata, graphs or other objects. An important problem seems to be the problem of parallelization of languages. Our examples deal only with context-free and regular languages.
openaire +1 more source
Summary: Shuffle on trajectories is a useful tool to study a variety of problems in the area of parallel composition of words, processes, automata, graphs or other objects. An important problem seems to be the problem of parallelization of languages. Our examples deal only with context-free and regular languages.
openaire +1 more source
Applied Mathematics and Computation, 2001
The following theorem is proved by using a continuation method: Consider an autonomous differential equation system \[ x'(t)= f(x(t)),\quad x(t_0)= x_0,\tag{1} \] where \(f: \mathbb{R}^n\to \mathbb{R}^n\) satisfies 1. \(f\in C^1(\mathbb{R}^n)\); 2. There is a constant \(k\) such that \(\| f(x)\|< k\) when \(x(\cdot)\) is a solution to problem (1); 3 ...
openaire +2 more sources
The following theorem is proved by using a continuation method: Consider an autonomous differential equation system \[ x'(t)= f(x(t)),\quad x(t_0)= x_0,\tag{1} \] where \(f: \mathbb{R}^n\to \mathbb{R}^n\) satisfies 1. \(f\in C^1(\mathbb{R}^n)\); 2. There is a constant \(k\) such that \(\| f(x)\|< k\) when \(x(\cdot)\) is a solution to problem (1); 3 ...
openaire +2 more sources
Private Trajectory Data Publication for Trajectory Classification
2019Trajectory classification (TC), i.e., predicting the class labels of moving objects based on their trajectories and other features, has many important real-world applications. Private trajectory data publication is to anonymize trajectory data, which can be released to the public or third parties.
Huaijie Zhu +4 more
openaire +1 more source
Fundam. Informaticae, 2006
Summary: We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations.
Michael Domaratzki +2 more
openaire +2 more sources
Summary: We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations.
Michael Domaratzki +2 more
openaire +2 more sources
2012 20th Signal Processing and Communications Applications Conference (SIU), 2012
Mehmet Fatih Amasyali +2 more
openaire +1 more source
Mehmet Fatih Amasyali +2 more
openaire +1 more source
Developmental trajectories of math anxiety during adolescence: Associations with STEM career choice
Journal of Adolescence, 2018Wondimu Ahmed
exaly