Elementariness of a finite set of words is co-NP-complete-Reference-Cited by-同舟云学术

Elementariness of a finite set of words is co-NP-complete

Published:1990 Issue:5 Volume:24 Page:459-470
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Neraud Jean

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/1990240504591/pdf

Reference14 articles.

1. 1. BAASE S., Introduction to Design and Analysis. Addison Wesley, 1982.0407.68044

2. 2. BERSTEL J., and PERRIN D., Theory of codes, Academic Press, 1985.7970690587.68066

3. 3. BERSTEL J.,PERRIN D.,PERROT J. F. and RESTIVO A., Sur le théorème du défaut, Journal of Algebra, September 1979, 60, n° 1, pp. 169-180.5491030421.20027

4. 4. CULIK II K. and FRIS I., The decidability of equivalence problem for DOL- systems, Inform. Control, 1977, 33, pp. 20-39.4490300365.68074

5. 5. EHRENFEUCHT A. and ROSENBERG G., Elementary homomorphisms and a solution to DOL sequence equivalence problem, Theoret. Comput. Sci., 1978, 7, pp. 76-85.5090150407.68085

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Primitive sets of words;Theoretical Computer Science;2021-04

2. On Sets of Words of Rank Two;Lecture Notes in Computer Science;2019

3. A two-stage constructive method for the unweighted minimum string cover problem;Knowledge-Based Systems;2015-03

4. On Finding Small 2-Generating Sets;Lecture Notes in Computer Science;2009

5. The Minimum Substring Cover problem;Information and Computation;2008-11