Detecting palindromes, patterns and borders in regular languages

Information and Computation

Volumn 207, Issue 11, 2009, Pages 1096-1118

  Anderson, Terry ^a   Loftus, John ^b   Rampersad, Narad ^a   Santean, Nicolae ^a   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Luzerne County Community College   (United States)

Author keywords

Bordered word; k Power; Palindrome; Pattern; Primitive word

Indexed keywords

BORDERED WORD; K-POWER; PALINDROME; PATTERN; PRIMITIVE WORD;

FINITE AUTOMATA; QUERY LANGUAGES;

LINGUISTICS;

EID: 70349733139     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.06.007     Document Type: Article

References (34)

1. M. Ackerman, J. Shallit, Efficient enumeration of regular languages, in: Proceedings of the Implementation and Application of Automata, 12th International Conference (CIAA 2007), vol. 4783, Lecture Notes in Computer Science, Springer-Verlag, 2007, pp. 226-242.
2. Aho A., Hopcroft J., and Ullman J. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley
3. Birget J.-C. Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43 (1992) 185-190
4. Castiglione G., Restivo A., and Salemi S. Patterns in words and languages. Discrete Appl. Math. 144 (2004) 237-246
5. Chrobak M. Finite automata and unary languages. Theor. Comput. Sci. 47 (1986) 149-158 (Errata 302 (2003) 497-498)
6. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press
7. Dömösi P., Horváth G., and Ito M. A small hierarchy of languages consisting of non-primitive words. Publ. Math. (Debrecen) 64 (2004) 261-267
8. P. Dömösi, C. Marti{dotless}́n-Vide, V. Mitrana, Remarks on sublanguages consisting of primitive words of slender regular and context-free languages, in: J. Karhumäki et al. (Eds.), Theory is Forever, vol. 3113, Lecture Notes in Computer Science, Springer-Verlag, 2004, pp. 60-67.
9. Ellul K., Krawetz B., Shallit J., and Wang M. Regular expressions: new results and open problems. J. Automata Lang. Combin. 9 (2004) 233-256
10. Garey M., and Johnson D. Computers and Intractability (1979), Freeman
11. Glaister I., and Shallit J. A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59 (1996) 75-77
12. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers. fifth ed. (1979), Oxford
13. Heath-Brown D.R. Zero-free regions for Dirichlet L-functions, and the least prime in an arithmetic progression. Proc. Lond. Math. Soc. 64 (1992) 265-338
14. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
15. Horváth S., Karhumäki J., and Kleijn J. Results concerning palindromicity. J. Inf. Process. Cybern. EIK 23 (1987) 441-451
16. H.B. Hunt III, On the time and tape complexity of languages. I, in: Proceedings of the Fifth Annual ACM Symposium Theoretical Computation ACM, 1973, pp. 10-19.
17. Ito M., Katsura M., Shyr H.J., and Yu S.S. Automata accepting primitive words. Semigroup Forum 37 (1988) 45-52
18. J.-Y. Kao, J. Shallit, Z. Xu, The noncommutative Frobenius problem, in preparation.
19. Knuth D., Morris Jr. J., and Pratt V. Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323-350
20. Kunze M., Shyr H.J., and Thierrin G. h-Bounded and semi-discrete languages. Inform. Control 51 (1981) 147-187
21. p in a free group. Mich. Math. J. 9 (1962) 289-298
22. Mäkinen E. On lexicographic enumeration of regular and context-free languages. Acta Cybern. 13 (1997) 55-61
23. A. Martinez, Efficient computation of regular expressions from unary NFAs, in: Proceedings of the Descriptional Complexity of Formal Systems (DCFS 2002), 2002, pp. 174-187.
24. Miller W. The maximum order of an element of a finite symmetric group. Am. Math. Mon. 94 (1987) 497-506
25. Pritchard P. Linear prime-number sieves: a family tree. Sci. Comput. Program. 9 (1987) 17-35
26. Pǎun G., and Salomaa A. Thin and slender languages. Discrete Appl. Math. 61 (1995) 257-270
27. A. Restivo, S. Salemi, Words and patterns, in: Proceedings of the Developments in Language Theory, 5th International Conference (DLT 2001), vol. 2295, Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 117-129.
28. Rosaz L. Puzzle corner, #50. Bull. Eur. Assoc. Theor. Comput. Sci. 76 (2002) 234 solution in No. 77 (June 2002) 261
29. Savitch W. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4 (1970) 177-192
30. Shallit J. Numeration systems, linear recurrences, and regular sets. Inform. Comput. 113 (1994) 331-347
31. Shallit J., and Breitbart Y. Automaticity I: properties of a measure of descriptional complexity. J. Comput. Syst. Sci. 53 (1996) 10-25
32. +. Soochow J. Math. 20 (1994) 535-546
33. Yu S. Regular languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages (1997), Springer-Verlag 41-110 (Chapter 1)
34. Zhang G.-Q. Automata, boolean matrices, and ultimate periodicity. Inform. Comput. 152 (1999) 138-154