Abstract
We contribute new facets to the discussion on the equivalence problem for E-pattern languages (also referred to as extended or erasing pattern languages). This fundamental open question asks for the existence of a computable function that, given any pair of patterns, decides whether or not they generate the same language. Our main result disproves Ohlebusch and Ukkonen’s conjecture (Theoretical Computer Science 186, 1997) on the equivalence problem; the respective argumentation, that largely deals with the nondeterminism of pattern languages, is restricted to terminal alphabets with at most four distinct letters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)
Bean, D.R., Ehrenfeucht, A., McNulty, G.F.: Avoidable patterns in strings of symbols. Pacific J. Math. 85, 261–294 (1979)
Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 6, pp. 329–438. Springer, Heidelberg (1997)
Dány, G., Fülöp, Z.: A note on the equivalence problem of E-patterns. Inf. Process. Lett. 57, 125–128 (1996)
Filè, G.: The relation of two patterns with comparable language. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 184–192. Springer, Heidelberg (1988)
Harju, T., Karhumäki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 7, pp. 439–510. Springer, Heidelberg (1997)
Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Int. J. Comput. Math. 50, 147–163 (1994)
Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci. 50, 53–63 (1995)
Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Inform. théor. 28(3–4), 233–253 (1994)
Mateescu, A., Salomaa, A.: Patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch.4.6, pp. 230–242. Springer, Heidelberg (1997)
Ohlebusch, E., Ukkonen, E.: On the equivalence problem for E-pattern languages. Theor. Comp. Sci. 186, 231–248 (1997)
Reidenbach, D.: A discontinuity in pattern inference. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 129–140. Springer, Heidelberg (2004)
Reidenbach, D.: On the learnability of E-pattern languages over small alphabets. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol. 3120, pp. 140–154. Springer, Heidelberg (2004)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)
Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1982)
Thue, A.: Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 7 (1906)
Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 1 (1912)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reidenbach, D. (2004). On the Equivalence Problem for E-Pattern Languages Over Small Alphabets. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)