On the equivalence problem for E-pattern languages over small alphabets

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

Volumn 3340, Issue , 2004, Pages 368-380

  Reidenbach, Daniel ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

COMPUTABLE FUNCTIONS; EQUIVALENCE PROBLEM; NON DETERMINISM; PATTERN LANGUAGES; THEORETICAL COMPUTER SCIENCE; NON-DETERMINISM;

EQUIVALENCE CLASSES;

EID: 35048817030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_31     Document Type: Article

References (17)

1. D. Angluin. Finding patterns common to a set of strings. J. Comput. Syst. Sci., 21:46-62, 1980.
2. D.R. Bean, A. Ehrenfeucht, and G.F. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math., 85:261-294, 1979.
3. C. Choffrut and J. Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 6, pages 329-438. Springer, 1997.
4. G. Dány and Z. Fülöp. A note on the equivalence problem of E-patterns. Inf. Process. Lett., 57:125-128, 1996.
5. G. Filè. The relation of two patterns with comparable language. In Proc. STACS 1988, volume 294 of LNCS, pages 184-192, 1988.
6. T. Harju and J. Karhumäki. Morphisms. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 7, pages 439-510. Springer, 1997.
7. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, and S. Yu. Pattern languages with and without erasing. Int. J. Comput. Math., 50:147-163, 1994.
8. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. J. Comput. Syst. Sci., 50:53-63, 1995.
9. A. Mateescu and A. Salomaa. Finite degrees of ambiguity in pattern languages. RAIRO Inform, théor., 28(3-4):233-253, 1994.
10. A. Mateescu and A. Salomaa. Patterns. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 4.6, pages 230-242. Springer, 1997.
11. E. Ohlebusch and E. Ukkonen. On the equivalence problem for E-pattern languages. Theor. Comp. Sci., 186:231-248, 1997.
12. D. Reidenbach. A discontinuity in pattern inference. In Proc. STACS 2004, volume 2996 of LNCS, pages 129-140, 2004.
13. D. Reidenbach. On the learnability of E-pattern languages over small alphabets. In Proc. COLT 2004, volume 3120 of LNAI, pages 140-154, 2004.
14. G. Rozenberg and A. Salomaa. Handbook of Formal Languages, volume 1. Springer, Berlin, 1997.
15. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Proc. RIMS Symp., volume 147 of LNCS, pages 115-127, 1982.
16. A. Thue. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Shifter. I Mat. Nat. Kl., 7, 1906.
17. A. Thue. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl., 1, 1912.