Root-restricted Kleenean rotations

DOI10.1016/j.ipl.2010.10.014zbMath1260.68211OpenAlexW2032009499MaRDI QIDQ1944034

Jean-Marcel Pallo

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.014

zbMATH Keywords

formal languagesKleene theoremrestricted rotation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-restricted rotation distance between binary trees
• Refined upper bounds for right-arm rotation distances
• Weak associativity and restricted rotation
• Right-arm rotation distance between binary trees
• Bounding restricted rotation distance
• Rational languages defined with a non-associative concatenation
• Restricted rotation distance between binary trees.
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• A direct algorithm for restricted rotation distance
• Effective splaying with restricted rotations
• Nonassociativity à la Kleene
• BOUNDING RIGHT-ARM ROTATION DISTANCES

This page was built for publication: Root-restricted Kleenean rotations