Rampersad, N.
- Shuffling and Unshuffling
2011/06/28 by Dane Henshall, Narad Rampersad, Henshall, D. +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, programming, and type systems #semigroups and automata theory
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
2009/07/01 by Narad Rampersad, Jeffrey Shallit, Rampersad, N. +3 · 1 citation
Computer Science · #Algorithms and Data Compression #Coding theory and cryptography #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory