Unambiguous morphic images of strings

International Journal of Foundations of Computer Science

Volumn 17, Issue 3, 2006, Pages 601-628

  Freydenberger, Dominik D ^a,b   Reidenbach, Daniel ^a   Schneider, Johannes C ^a  

^a France   (Germany)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Ambiguity; Combinatorics on words; Morphisms; Pattern languages

Indexed keywords

EID: 33746190623     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106004017     Document Type: Conference Paper

References (16)

1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980.
2. J. Berstel and D. Perrin. Theory of Codes. Academic Press, Orlando, 1985.
3. C. Choffrut and J. Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 6, pages 329-438. Springer, 1997.
4. E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
5. D. Hamm and J. Shallit. Characterization of finite and one-sided infinite fixed points of morphisms on free monoids. Technical Report CS-99-17, Dep. of Computer Science, University of Waterloo, 1999. http://www.cs.uwaterloo.ca/ ~shallit/papers.html.
6. T. Harju and J. Karhumäki. Morphisms. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 7, pages 439-510. Springer, 1997.
7. T. Head. Fixed languages and the adult languages of 0L schemes. International Journal of Computer Mathematics, 10:103-107, 1981.
8. S. Lange and R. Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generation Computing, 8:361-370, 1991.
9. F. Levé and G. Richomme. On a conjecture about finite fixed points of morphisms. Theoretical Computer Science, 339:103-128, 2005.
10. M. Lipponen and G. Pǎun. Strongly prime PCP words. Discrete Applied Mathematics, 63:193-197, 1995.
11. M. Lothaire. Combinatorics on Words. Addison-Wesley, Reading, MA, 1983.
12. A. Mateescu and A. Salomaa. Finite degrees of ambiguity in pattern languages. RAIRO Informatique théoretique et Applications, 28:233-253, 1994.
13. A. Mateescu and A. Salomaa. Patterns. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 4.6, pages 230-242. Springer, 1997.
14. E.L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264-268, 1946.
15. D. Reidenbach. A discontinuity in pattern inference. In Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, volume 2996 of Lecture Notes in Computer Science, pages 129-140, 2004.
16. D. Reidenbach. A non-learnable class of E-pattern languages. Theoretical Computer Science, 350:91-102, 2006.