Inclusion is undecidable for pattern languages

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

Volumn 700 LNCS, Issue , 1993, Pages 301-312

  Jiang, Tao ^a   Salomaa, Arto ^b   Salomaa, Kai ^c   Yu, Sheng ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF TURKU   (Finland)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Decidability; Equivalence problems; Inclusion problems; Pattern languages; Patterns

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES;

EQUIVALENCE PROBLEM; INCLUSION PROBLEM; PATTERN LANGUAGES; PATTERNS;

AUTOMATA THEORY;

EID: 85027615297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56939-1_81     Document Type: Conference Paper

References (12)

1. D. Angluin, “Finding patterns common to a set of strings”, Journal of Computer and System Sciences 21 (1980) 46-62.
2. D. Angluin, “Inductive inference of formal languages from positive data”, Information and Control 45 (1980) 117-135.
3. B.S. Baker and R.V. Book, “Reversal-bounded multipushdown machines”, Journal of Computer and System Sciences 8 (1974) 315-332.
4. D. R. Bean, A. Ehrenfeucht, and G. F. McNulty, “Avoidable patterns in strings of symbols”, Pacific Journal of Mathematics 85 (1979) 261-294.
5. T. Harju and J. Karhums “The equivalence problem of multitape finite automata”, Theoretical Computer Science 78 (1991) 347-355.
6. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978.
7. O.H. Ibarra, “Reversal-bounded multicounter machines and their decision problems”, Journal of the Association for Computing Machinery 25 (1978) 116-133.
8. O. Ibarra and T. Jiang “Learning regular languages from counterexamples”, Journal of Computer and System Sciences, 43 (1991) 299-316.
9. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, S. Yu, “Pattern languages with and without erasing”, to appear in the International Journal of Computer Mathematics.
10. M.L. Minsky, “Recursive unsolvability of Post’s problem of’Tag’ and other topics in theory of Turing machines”, Annals of Mathematics 74 (1961) 437-455.
11. N. Tanida and T. Yokomori, “PolynomiM-time identitlcation of strictly regular languages in the limit”, IEICE Trans. Inf. and Syst. E75-D (1992) 125-132.
12. A. Thue, ‘Über unendliche Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania 7 (1906) 1-22.