SZTE Repository of Papers and Books: No conditions. Results ordered -Date Deposited. 2020-10-22T15:23:10ZEPrintshttp://acta.bibl.u-szeged.hu/images/acta.jpghttp://acta.bibl.u-szeged.hu/2016-10-15T12:25:32Z2018-06-05T15:25:39Zhttp://acta.bibl.u-szeged.hu/id/eprint/12796This item is in the repository with the URL: http://acta.bibl.u-szeged.hu/id/eprint/127962016-10-15T12:25:32ZRotational tree structures on binary trees and triangulationsA rotation in a binary tree is a simple and local restructuring technique commonly used in computer science. We propose in this paper three restrictions on the general rotation operation. We study the case when only leftmost rotations are permitted, which corresponds to a natural flipping on polygon triangulations. The resulting combinatorial structure is a tree structure with the root as the greatest element. We exhibit an efficient algorithm for computing the join of two trees and the minimum number of leftmost rotations necessary to transform one tree into the other.Jean Marcel Pallo2016-10-15T12:25:10Z2018-06-06T11:28:35Zhttp://acta.bibl.u-szeged.hu/id/eprint/12879This item is in the repository with the URL: http://acta.bibl.u-szeged.hu/id/eprint/128792016-10-15T12:25:10ZKleene revisited by SuschkewitschThe aim of this paper is to generalize to nonassociative concatenation the well-known property that the family of left-linear languages is exactly the family of regular languages. For this purpose, we introduce a generalized
Kleene star operation.Jean Marcel Pallo