Rational series and their languages
Rational series and their languages
Formal languages and power series
Handbook of theoretical computer science (vol. B)
A shortest path metric on unlabeled binary trees
Pattern Recognition Letters
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Languages rationnels définis avec une concaténation non-associative
Theoretical Computer Science
Restricted rotation distance between binary trees
Information Processing Letters
Linear languages with a nonassociative concatenation
Journal of Automata, Languages and Combinatorics
Right-arm rotation distance between binary trees
Information Processing Letters
Bounding restricted rotation distance
Information Processing Letters
A direct algorithm for restricted rotation distance
Information Processing Letters
Theoretical Computer Science
k-Restricted rotation distance between binary trees
Information Processing Letters
Rotational tree structures on binary trees and triangulations
Acta Cybernetica
Note: Refined upper bounds for right-arm rotation distances
Theoretical Computer Science
Effective splaying with restricted rotations
International Journal of Computer Mathematics
Weak associativity and restricted rotation
Information Processing Letters
Kleene revisited by Suschkewitsch
Acta Cybernetica
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
| Hi-index | 0.89 |
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.