Name
Abstract | ||
|---|---|---|
A language L is called the orthogonal shuffle of the language L(1) with the language L(2), along the trajectory set T if every word in L is uniquely obtained as the shuffle between a word in L(1), a word in L(2) 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 orthogonal insertion. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S0129054111007964 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Shuffle on trajectories, Orthogonal operation, Language equation, Decidability | Language equation,Discrete mathematics,Combinatorics,Decidability,Catenation,Corollary,Trajectory,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 1 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Daley | 1 | 166 | 22.18 |
| Lila Kari | 2 | 1123 | 124.45 |
| Shinnosuke Seki | 3 | 189 | 29.78 |
| Petr Sosík | 4 | 479 | 68.66 |