Results 271 to 280 of about 4,588,425 (332)

PARIKH MATRIX MAPPING AND LANGUAGES

International Journal of Foundations of Computer Science, 2010
Restricting the Parikh Matrix mapping to a language rather than to an alphabet rises a set of problems that seem interesting to us. Moreover, amiability (or M -equivalence as it is named by other authors) is exploited in order to characterise certain types of languages. The paper also proposes a series of results establishing relations between classes
Radu-Florian Atanasiu
openaire   +3 more sources

Tensor-to-matrix mapping in elasto-optics

, 2020
A matrix method for tensor transformations in Voigt notation known from the elasticity calculations has been applied to elasto-optical calculations. Using invariant tensor-to-matrix mapping, the second- and fourth-rank Cartesian tensor transformations ...
O. Slezák, A. Lucianetti, T. Mocek
semanticscholar   +1 more source

Cyber Threat Dictionary Using MITRE ATT&CK Matrix and NIST Cybersecurity Framework Mapping

IEEE Radio and Wireless Symposium, 2020
Cyber-attack and defense frameworks offer numerous ways to protect systems and networks from threats. However, only a few of these numerous attack and defense frameworks provide countermeasures by linking multiple frameworks.
Roger Kwon, Travis Ashley, Jerry Castleberry, P. McKenzie, Sri Nikhil Gupta Gourisetti   +4 more
semanticscholar   +1 more source

Enriching Parikh matrix mappings

International Journal of Computer Mathematics, 2013
In this paper, we define the Super-Parikh S-Parikh matrix mapping as an extension of the Parikh matrix mapping introduced by Mateescu et al . Like the Parikh matrix, the extension revolves around a certain type of square matrices, but instead of non-negative integers, its matrix-mapped elements are non-negative rationals fractions.
Adrian Atanasiu, Radu-Florian Atanasiu
openaire   +1 more source

COUPLED-EXPANDING MAPS AND MATRIX SHIFTS

International Journal of Bifurcation and Chaos, 2013
For an irreducible transition matrix A of size m × m, which is not a permutation, a map f : X → X is said to be strictly A-coupled-expanding if there are nonempty sets V1,…, Vm ⊂ X such that the distance between any two of them is positive and f(Vi) ⊃ Vj holds whenever aij = 1.
MARCIN KULCZYCKI, PIOTR OPROCHA
openaire   +3 more sources

Mapping Matrix Algorithms

1992
We now consider the use of the multimesh graph method for mapping matrix algorithms onto existing application-specific array processors. The term application-specific indicates that the processing elements and the interconnection structure are basically well-suited for the class of matrix algorithms. However, since the underlying generality is achieved
Jaime H. Moreno, Tomás Lang
openaire   +1 more source

On the Injectivity of the Parikh Matrix Mapping

Fundamenta Informaticae, 2002
In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as ``palindromic amiable'', such that two such words are palindromic amiable ...
Adrian Atanasiu, C. Martín-Vide, A. Mateescu   +2 more
semanticscholar   +1 more source

TOTALLY CONTRACTIVE MAPPINGS ON MATRIX BALLS

Analysis, 1986
This paper gives some properties of totally contractive holomorphic mappings of the unit \(n\times n\) matrix ball. It shows that any linear totally contractive mapping L must satisfy the equation \(\det L(Z)=\det L(I)\cdot \det Z\) for all Z in the unit ball; in fact this equation, together with det L(I)\(\neq 0\), characterizes (up to scalar ...
openaire   +1 more source

Linear Maps Preserving Matrix Discriminant

Journal of Mathematical Sciences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources