Decision problems for convex languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5457, Issue , 2009, Pages 247-258

  Brzozowski, Janusz ^a   Shallit, Jeffrey ^a   Xu, Zhi ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; NUMBER OF STATE; POLYNOMIAL-TIME; REGULAR LANGUAGES; SUBWORD; UPPER BOUND;

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; TERMINOLOGY; TRANSLATION (LANGUAGES);

LINGUISTICS;

EID: 67649995916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00982-2_21     Document Type: Conference Paper

References (12)

1. Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages, and Programming, pp. 481-492. North-Holland, Amsterdam (1973)
2. Ang, T., Brzozowski, J.: Continuous languages. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) Proc. 12th International Conference on Automata and Formal Languages, pp. 74- 85. Computer and Automation Research Institute, Hungarian Academy of Sciences (2008)
3. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)
4. Han, Y.S.: Decision algorithms for subfamilies of regular languages using state-pair graphs. Bull. European Assoc. Theor. Comput. Sci. (93), 118-133 (2007)
5. Brzozowski, J.A., Shallit, J., Xu, Z.: Decision problems for convex languages (preprint, 2008), http://arxiv.org/abs/0808.1928
6. Béal, M.P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fund. Inform. 56, 121-135 (2003)
7. de Luca, A., Varricchio, S.: Some combinatorial properties of factorial languages. In: Capocelli, R. (ed.) Sequences, pp. 258-266. Springer, Heidelberg (1990)
8. Han, Y.S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Found. Comp. Sci. 17, 379-393 (2006)
9. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
10. Hunt III, H.B., Rosenkrantz, D.J.: Computational parallels between the regular and context-free languages. SIAM J. Comput. 7, 99-114 (1978)
11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
12. Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Vol. 1, pp. 511-607. Springer, Heidelberg (1997)