Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 31, Number 3, 1997
Page(s) 291 - 304
DOI https://doi.org/10.1051/ita/1997310302911
Published online 01 February 2017
  1. 1. J. ALBERT and K. CULIK II, Test sets for homomorphism équivalence on context free languages, Information and Control, 1980, 45, pp. 273-284. [MR: 590851] [Zbl: 0453.68048] [Google Scholar]
  2. 2. J. ALBERT, K. CULIK II and J. KARHUMÄKI, Test sets for context free languages and algebraic systems of equations over free monoid, Information and Control, 1982, 52, pp. 172-186. [MR: 701592] [Zbl: 0522.68064] [Google Scholar]
  3. 3. M. H. ALBERT and J. LAWRENCE, A proof of Ehrenfeucht's conjecture, Theoret. Comput. Sci., 1985, 41, pp. 121-123. [MR: 841029] [Zbl: 0602.68066] [Google Scholar]
  4. 4. J. ALBERT and D. WOOD, Checking sets, test sets rich languages and commutatively closed languages, Journal of Computer and System Sciences, 1983, 26, pp. 82-91. [MR: 699221] [Zbl: 0507.68049] [Google Scholar]
  5. 5. I. HAKALA and J. KORTELAINEN, On the system of word equations xi1 xi2...xim = yi1 yi2...y1n (i = 1, 2, ...) in a free monoid, Acta Inform., 1997, 34, pp. 217-230. [MR: 1465039] [Zbl: 0877.68073] [Google Scholar]
  6. 6. I. HAKALA and J. KORTELAINEN, On the system of word equations xo ui1 xo ui1 x1 ui2 x2 ui3 x3 = yo vi1 y1 vi2 y2 vi3 y3 (i = 0, 1, 2,...) in a free monoid, Theor. Comput Sci. (to appear). [MR: 1708036] [Google Scholar]
  7. 7. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading Massachusetts, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  8. 8. J. KARHUMÄKI, W. PLANDOWSKI and W. RYTTER, Polynomial-size test sets for context-free languages, Lecture Notes in Computer Sciences, 1992, 623, pp. 53-64. [MR: 1250630] [Zbl: 0834.68065] [Google Scholar]
  9. 9. J. KARHUMÄKI, W. PLANDOWSKI and W. RYTTER, Polynomial-size test sets for context-free languages, Journal of Computer and System Sciences, 1995, 50, pp. 11-19. [MR: 1322629] [Zbl: 0834.68065] [Google Scholar]
  10. 10. J. KARHUMÄKI, W. PLANDOWSKI and S. JAROMINEK, Efficient construction of test sets for regular and context-free languages, Theor. Comp. Sci., 1993, 116, pp. 305-316. [MR: 1231947] [Zbl: 0793.68090] [Google Scholar]
  11. 11. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley, Reading Massachusetts, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.