Author:
Moldagaliyev Birzhan,Staiger Ludwig,Stephan Frank
Publisher
Springer International Publishing
Reference29 articles.
1. Calude, C.S.: Information and Randomness - An Algorithmic Perspective, 2nd (edn.). Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-662-04978-5
2. Cassaigne, J.: Special factors of sequences with linear subword complexity. In: Developments in Language Theory, DLT 1995, pp. 25–34. World Scientific Publishing, Singapore (1996)
3. Lecture Notes in Computer Science;J Cassaigne,2014
4. Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010). https://doi.org/10.1007/978-0-387-68441-3
5. Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various classes of deterministic developmental languages without interactions. Theor. Comput. Sci. 1, 59–75 (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ON THE INCOMPUTABILITY OF COMPUTABLE DIMENSION;LOG METH COMPUT SCI;2020
2. Finite Automata and Randomness;Descriptional Complexity of Formal Systems;2018