Prasad, Amritanshu (2018) Knuth's Moves on Timed Words
Full text not available from this repository.
Abstract
We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization of these results to timed words.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Web Accessibility Assistance. |
| ID Code: | 121491 |
| Deposited On: | 17 Jul 2021 07:55 |
| Last Modified: | 17 Jul 2021 07:55 |
Repository Staff Only: item control page
