The SCEAS System
| |||||||

## Search the dblp DataBase
Narad Rampersad:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Narad Rampersad
**Words Avoiding 7/3-Powers and the Thue-Morse Morphism.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2004, pp:357-367 [Conf] - Narad Rampersad
**The state complexity of L**[Citation Graph (0, 0)][DBLP]^{2}and L^{k} CoRR, 2004, v:0, n:, pp:- [Journal] - Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
**Cubefree binary words avoiding long squares**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
**Avoiding large squares in infinite binary words**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Narad Rampersad
**Words avoiding 7/3-powers and the thue-morse morphism.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:755-766 [Journal] - Narad Rampersad
**The state complexity of L**[Citation Graph (0, 0)][DBLP]^{2}and L^{k}. Inf. Process. Lett., 2006, v:98, n:6, pp:231-234 [Journal] - Narad Rampersad
**On the context-freeness of the set of words containing overlaps.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:2-3, pp:74-78 [Journal] - Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
**Avoiding large squares in infinite binary words.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:339, n:1, pp:19-34 [Journal] - Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
**Avoiding Approximate Squares.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2007, pp:278-289 [Conf] **Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.**[Citation Graph (, )][DBLP]**On the Complexity of Deciding Avoidability of Sets of Partial Words.**[Citation Graph (, )][DBLP]**Finite Automata, Palindromes, Powers, and Patterns.**[Citation Graph (, )][DBLP]**Binary Words Containing Infinitely Many Overlaps.**[Citation Graph (, )][DBLP]**Finite automata, palindromes, patterns, and borders**[Citation Graph (, )][DBLP]**Finding the growth rate of a regular language in polynomial time**[Citation Graph (, )][DBLP]**Periodicity, repetitions, and orbits of an automatic sequence**[Citation Graph (, )][DBLP]**On NFAs Where All States are Final, Initial, or Both**[Citation Graph (, )][DBLP]**A proof of Dejean's conjecture**[Citation Graph (, )][DBLP]**Detecting patterns in finite regular and context-free languages**[Citation Graph (, )][DBLP]**The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages**[Citation Graph (, )][DBLP]**Further applications of a power series method for pattern avoidance**[Citation Graph (, )][DBLP]**Automata and Reduced Words in the Free Group**[Citation Graph (, )][DBLP]**Abelian Primitive Words**[Citation Graph (, )][DBLP]**State Complexity of Testing Divisibility**[Citation Graph (, )][DBLP]**Inverse Star, Borders, and Palstars**[Citation Graph (, )][DBLP]**There are k-uniform cubefree binary morphisms for all k>=0.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |