The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Narad Rampersad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Narad Rampersad
    The state complexity of L2 and Lk [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. Narad Rampersad
    The state complexity of L2 and Lk. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:6, pp:231-234 [Journal]
  7. 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]
  8. 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]
  9. 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]

  10. Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time. [Citation Graph (, )][DBLP]


  11. On the Complexity of Deciding Avoidability of Sets of Partial Words. [Citation Graph (, )][DBLP]


  12. Finite Automata, Palindromes, Powers, and Patterns. [Citation Graph (, )][DBLP]


  13. Binary Words Containing Infinitely Many Overlaps. [Citation Graph (, )][DBLP]


  14. Finite automata, palindromes, patterns, and borders [Citation Graph (, )][DBLP]


  15. Finding the growth rate of a regular language in polynomial time [Citation Graph (, )][DBLP]


  16. Periodicity, repetitions, and orbits of an automatic sequence [Citation Graph (, )][DBLP]


  17. On NFAs Where All States are Final, Initial, or Both [Citation Graph (, )][DBLP]


  18. A proof of Dejean's conjecture [Citation Graph (, )][DBLP]


  19. Detecting patterns in finite regular and context-free languages [Citation Graph (, )][DBLP]


  20. The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages [Citation Graph (, )][DBLP]


  21. Further applications of a power series method for pattern avoidance [Citation Graph (, )][DBLP]


  22. Automata and Reduced Words in the Free Group [Citation Graph (, )][DBLP]


  23. Abelian Primitive Words [Citation Graph (, )][DBLP]


  24. State Complexity of Testing Divisibility [Citation Graph (, )][DBLP]


  25. Inverse Star, Borders, and Palstars [Citation Graph (, )][DBLP]


  26. There are k-uniform cubefree binary morphisms for all k>=0. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002