AI Chat AI Image Generator AI Video Text to Speech

Knuth's Moves on Timed Words

11/06/2018

∙

by Amritanshu Prasad, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 05/04/2023

Ranking and unranking bordered and unbordered words

A border of a word w is a word that is both a non-empty proper prefix an...

0 Daniel Gabric, et al. ∙

research

∙ 01/31/2020

On the binomial equivalence classes of finite words

Two finite words u and v are k-binomially equivalent if, for each word x...

0 Marie Lejeune, et al. ∙

research

∙ 06/12/2018

A Timed Version of the Plactic Monoid

Timed words are words where letters of the alphabet come with time stamp...

0 Amritanshu Prasad, et al. ∙

research

∙ 12/07/2022

Cocke–Younger–Kasami–Schwartz–Zippel algorithm and relatives

The equivalence problem for unambiguous grammars is an important, but ve...

0 Vladislav Makarov, et al. ∙

research

∙ 07/20/2022

Abelian Combinatorics on Words: a Survey

We survey known results and open problems in abelian combinatorics on wo...

0 Gabriele Fici, et al. ∙

research

∙ 04/01/2021

HLE-UPC at SemEval-2021 Task 5: Multi-Depth DistilBERT for Toxic Spans Detection

This paper presents our submission to SemEval-2021 Task 5: Toxic Spans D...

0 Rafel Palliser-Sans, et al. ∙

research

∙ 03/13/2019

Generalized de Bruijn words and the state complexity of conjugate sets

We consider a certain natural generalization of de Bruijn words, and use...

0 Daniel Gabric, et al. ∙