Infinite permutations of lowest maximal pattern complexity

Sergey V. Avgustinovich, Anna E. Frid, T. Kamae, P. Salimov. Infinite permutations of lowest maximal pattern complexity. Theoretical Computer Science, 412(27):2911-2921, 2011. [doi]

@article{AvgustinovichFKS11,
  title = {Infinite permutations of lowest maximal pattern complexity},
  author = {Sergey V. Avgustinovich and Anna E. Frid and T. Kamae and P. Salimov},
  year = {2011},
  doi = {10.1016/j.tcs.2010.12.062},
  url = {http://dx.doi.org/10.1016/j.tcs.2010.12.062},
  tags = {e-science},
  researchr = {https://researchr.org/publication/AvgustinovichFKS11},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {412},
  number = {27},
  pages = {2911-2921},
}