Abstract
The study of patterns goes back to the seminal work of Thue, [14], and is important also, for instance, in recent work concerning inductive inference, learning and term rewriting. We study different ways of generating pattern languages, the main emphasis being on decision problems.
Work supported by Project 11281 of the Academy of Finland.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21 (1980), 46–62.
D. R. Bean, A. Ehrenfeucht, and G. F. McNulty: Avoidable patterns in strings of symbols. Pacific Journal of Mathematics 85 (1979), 261–294.
J. Dassow, G. Paun, A. Salomaa: Grammars based on patterns. To appear in International Journal of Foundations of Computer Science.
T. Harju and J. Karhumäki: The equivalence problem of multitape finite automata. Theoretical Computer Science 78 (1991), 347–355.
M. A. Harrison: Introduction to Formal Language Theory. Addison-Wesley, Reading, 1978.
O. H. Ibarra: Reversal-bounded multicounter machines and their decision problems. Journal of the Association for Computing Machinery 25 (1978), 116–133.
T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, S. Yu: Pattern languages with and without erasing. To appear in International Journal of Computer Mathematics.
T. Jiang, A. Salomaa, K. Salomaa, S. Yu: Inclusion is undecidable for pattern languages. ICALP-93 Proceedings, Springer Lecture Notes in Computer Science (1993).
T. Jiang, A. Salomaa, K. Salomaa, S. Yu: Decision problems for patterns. Submitted for publication (1993).
L. Kari, A. Mateescu, G. Paun, A. Salomaa: Multipattern languages. Submitted for publication (1993).
V. Keränen: Abelian squares can be avoided on four letters. ICALP-92 Proceedings, Springer Lecture Notes in Computer Science 623 (1992), 41–52.
G. Kucherov, M. Rusinowitch: On ground-reducibility problem for word rewriting systems with variables. Submitted for publication.
A. Salomaa: Formal Languages. Academic Press (1973).
A. Thue: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania 7 (1906), 1–22.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salomaa, A. (1993). Pattern languages: Problems of decidability and generation. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive