Bad news on decision problems for patterns

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

Volumn 5257 LNCS, Issue , 2008, Pages 327-338

  Freydenberger, Dominik D ^a   Reidenbach, Daniel ^b  

^a GOETHE UNIVERSITY   (Germany)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; LINGUISTICS;

DECISION PROBLEMS; DECISION PROCEDURES; EQUIVALENCE PROBLEMS; FIXED ALPHABETS; INCLUSION PROBLEMS; PATTERN LANGUAGES;

QUERY LANGUAGES;

EID: 54249144095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85780-8_26     Document Type: Conference Paper

References (25)

1. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46-62 (1980)
2. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117-135 (1980)
3. Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14, 1007-1018 (2003
4. Dányi, G., Fülöp, Z.: A note on the equivalence problem of E-patterns. Information Processing Letters 57, 125-128 (1996)
5. Filè, G.: The relation of two patterns with comparable language. In: Proc. STACS 1988. LNCS, vol. 294, pp. 184-192. Springer, Heidelberg (1988)
6. Freydenberger, D.D., Reidenbach, D., Schneider, J.C.: Unambiguous morphic images of strings. Int. J. Found. Comput. Sci. 17, 601-628 (2006)
7. Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25, 116-133 (1978)
8. Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Int. J. Comput. Math. 50, 147-163 (1994)
9. Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. Journal of Computer and System Sciences 50, 53-63 (1995)
10. Karhumäki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. Journal of the ACM 47, 483-505 (2000)
11. Luo, W.: Compute inclusion depth of a pattern. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 689-690. Springer, Heidelberg (2005)
12. Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Informatique théoretique et Applications 28, 233-253 (1994)
13. Mateescu, A., Salomaa, A.: Patterns. In: [22], pp. 230-242 (1997)
14. Minsky, M.: Recursive unsolvability of Post's problem of "Tag" and other topics in the theory of turing machines. Ann. of Math. 74, 437-455 (1961)
15. Mukouchi, Y.: Characterization of pattern languages. In: Proc. 2nd International Workshop on Algorithmic Learning Theory, ALT 1991, pp. 93-104 (1991)
16. Ng, Y.K., Shinohara, T.: Developments from enquiries into the learnability of the pattern languages from positive data. Theor. Comp. Sci. 397, 150-165 (2008)
17. Ohlebusch, E., Ukkonen, E.: On the equivalence problem for E-pattern languages. Theor. Comput. Sci. 186, 231-248 (1997)
18. Reidenbach, D.: The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages. Logos Verlag, Berlin (2006)
19. Reidenbach, D.: A non-learnable class of E-pattern languages. Theor. Comput. Sci. 350, 91-102 (2006)
20. Reidenbach, D.: An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages. Journal of Automata, Languages and Combinatorics 12, 407-426 (2007)
21. Reidenbach, D.: Discontinuities in pattern inference. Theor. Comput. Sci. 397, 166-193 (2008)
22. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)
23. Salomaa, K.: Patterns. In: Martin-Vide, C., Mitrana, V., Pǎun, G. (eds.) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol. 148, pp. 367-379. Springer, Heidelberg (2004)
24. Salomaa, K.: Patterns. Lecture, 5th PhD School in Formal Languages and Applications, URV Tarragona (2006)
25. Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Proc. RIMS Symposia on Software Sci. Eng. LNCS, vol. 147, pp. 115-127. Springer, Heidelberg (1982)