Paul V. Salimov. Constructing Infinite Words of Intermediate Arithmetical Complexity. In Adrian Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide, editors, Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings. Volume 5457 of Lecture Notes in Computer Science, pages 696-701, Springer, 2009. [doi]
@inproceedings{Salimov09, title = {Constructing Infinite Words of Intermediate Arithmetical Complexity}, author = {Paul V. Salimov}, year = {2009}, doi = {10.1007/978-3-642-00982-2_59}, url = {http://dx.doi.org/10.1007/978-3-642-00982-2_59}, researchr = {https://researchr.org/publication/Salimov09}, cites = {0}, citedby = {0}, pages = {696-701}, booktitle = {Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings}, editor = {Adrian Horia Dediu and Armand-Mihai Ionescu and Carlos Martín-Vide}, volume = {5457}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-00981-5}, }