A Congruence-Based Perspective on Finite Tree Automata

DOI10.3233/FI-2021-2091OpenAlexW4206221096MaRDI QIDQ5025071

Elena Gutiérrez, Pierre Ganty, Pedro Valero

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.11453

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backward and forward bisimulation minimization of tree automata
• Reduction of nondeterministic tree automata
• Theory of átomata
• Tree regular model checking: a simulation-based approach
• A geometrical view of the determinization and minimization of finite-state automata
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Minimal Ascending and Descending Tree Automata
• Applications of Weighted Automata in Natural Language Processing
• A congruence-based perspective on automata minimization algorithms
• The minimalization of tree automata

This page was built for publication: A Congruence-Based Perspective on Finite Tree Automata