Backward and Forward Bisimulation Minimisation of Tree Automata

DOI10.1007/978-3-540-76336-9_12zbMath1139.68363OpenAlexW2117952194MaRDI QIDQ3503899

Andreas Maletti, Johanna Högberg, Jonathan May

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_12

zbMATH Keywords

bisimulationnatural language processingtree automataminimisation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items (10)

Weak bisimulations for fuzzy automata ⋮ Backward and forward bisimulation minimization of tree automata ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Computing Simulations over Tree Automata ⋮ Minimizing deterministic weighted tree automata

Uses Software

• Tiburon

This page was built for publication: Backward and Forward Bisimulation Minimisation of Tree Automata