Author:
Nevisi Hossein,Reidenbach Daniel
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Billaud, M.: A problem with words. Letter in Newsgroup Comp. Theory (1993), https://groups.google.com/d/topic/comp.theory/V_xDDtoR9a4/discussion
2. Freydenberger, D.D., Nevisi, H., Reidenbach, D.: Weakly unambiguous morphisms. Theoretical Computer Science (to appear)
3. Freydenberger, D.D., Reidenbach, D., Schneider, J.C.: Unambiguous morphic images of strings. International Journal of Foundations of Computer Science 17, 601–628 (2006)
4. Head, T.: Fixed languages and the adult languages of 0L schemes. International Journal of Computer Mathematics 10, 103–107 (1981)
5. Holub, S.: Polynomial-time algorithm for fixed points of nontrivial morphisms. Discrete Mathematics 309, 5069–5076 (2009)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献