Orthogonal shuffle on trajectories

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F11%3A%230003707" target="_blank" >RIV/47813059:19240/11:#0003707 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1142/S0129054111007964" target="_blank" >http://dx.doi.org/10.1142/S0129054111007964</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0129054111007964" target="_blank" >10.1142/S0129054111007964</a>

Result language

angličtina

Original language name

Orthogonal shuffle on trajectories

Original language description

A language L is called the orthogonal shuffle of the language L1 with the language L2, along the trajectory set T if every word in L is uniquely obtained as the shuffle between a word in L1, a word in L2 along a trajectory word in T. In this paper we investigate properties of the orthogonal shuffle on trajectories, as well as several types of language equations using this language operation. As a corollary, we obtain several properties of orthogonal catenation, orthogonal literal shuffle and orthogonalinsertion.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

ISSN

0129-0541

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

22

Country of publishing house

SG - SINGAPORE

Number of pages

10

Pages from-to

213-222

UT code for WoS article

—

EID of the result in the Scopus database

—