Generalizing stack sorting and $c$-sorting for permutations, we define the permutree algorithm. Given two disjoint subsets $U$ $D$ of $\{2, \dots, n-1\}$, $(U,D)$-permutree tries to sort permutation $\pi \in \mathfrak{S}_n$ fails if only there are $1 \le i < j k n$ such that $\pi$ contains subword $jki$ $j U$ $kij$ D$. This algorithm is seen as a way explore an automaton which either rejects al...

In this study, spectral data within the wavelength range of 400–780 nm were used to evaluate ripeness stages achacha fruits. The status fruits was divided into seven stages. Both average and pixel-based approaches assess ripeness. accuracy n-level-error each stage predicted by using classification models (Support Vector Machine (SVM), Partial Least Square Discriminant Analysis (PLS-DA), Artific...