Minimisation of multiplicity tree automata
We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic. We also show that a polynomial bound in the standard Turing model would require...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
International Federation of Computational Logic
2017
|