Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. - Tomás Pecka; Jan Trávnícek; Radomír Polách; Jan Janousek (SLATE, 2018)

Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. - Tomás Pecka; Jan Trávnícek; Jan Janousek (Stringology, 2020)

Chatty ROADMs: Streaming Telemetry with Open Source Software and Open Hardware. - Jan Kundrát; Václav Kubernát; Tomás Pecka; Ondrej Havlis; Martin Slapák; Jaroslav Jedlinský; Josef Vojtech (ECOC, 2021)

Opening up ROADMs: streaming telemetry [Invited]. - Jan Kundrát; Michal Vasko; Radek Krejcí; Václav Kubernát; Tomás Pecka; Ondrej Havlis; Martin Slapák; Jaroslav Jedlinský; Josef Vojtech (JOCN, 2021)

Forward linearised tree pattern matching using tree pattern border array. - Jan Trávnícek; Tomás Pecka; Robin Oburka; Jan Janousek (Discret. Appl. Math., 2024)