Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination

Tomás Pecka, Jan Trávnícek, Jan Janousek. Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. In Jan Holub 0001, Jan Zdárek, editors, Prague Stringology Conference 2020, Prague, Czech Republic, August 31 - September 2, 2020. pages 11-22, Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, 2020. [doi]

Abstract

Abstract is missing.